package 成绩排名;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
String[][] student = new String[n][3]; //创建字符串数组的格式
Scanner str = new Scanner(System.in);
for(int i=0;i<n;i++)
{
student[i][0]=str.next();
student[i][1]=str.next();
student[i][2]=str.next();
}
int min=Integer.parseInt(student[0][2]); //假设最小的数wei【0】【2】
int max=Integer.parseInt(student[0][2]);
int[] sign= {0,0};
for(int i=0;i<n-1;i++) //for循环得出min以及max
{
if(min>Integer.parseInt(student[i+1][2]))
{
min=Integer.parseInt(student[i+1][2]);
sign[0]=i+1; //存入最小数的行数
}
if(max<Integer.parseInt(student[i+1][2]))
{
max=Integer.parseInt(student[i+1][2]);
sign[1]=i+1;
}
}
System.out.println(student[sign[1]][0]+" "+student[sign[1]][1]);
System.out.println(student[sign[0]][0]+" "+student[sign[0]][1]);
}
}