#include<bits/stdc++.h>
using namespace std;
int n;
struct runner{
string number;
int x;
int y;
int length;
};
bool compare(runner a,runner b){
return a.length<b.length;
}
int main()
{
cin>>n;
runner r[n];
for(int i=0;i<n;i++)
{
cin>>r[i].number>>r[i].x>>r[i].y;
r[i].length=abs((r[i].x)*(r[i].y));
}
sort(r,r+n,compare);
cout<<r[0].number<<" "<<r[n-1].number<<endl;
}