#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <string.h>
using namespace std;
struct st{
string s;
int p,vol,l;
double k;
}arr[105];
bool cmp(st x,st y){
if (x.k != y.k) return x.k < y.k;
else if (x.vol != y.vol) return x.vol > y.vol;
}
int main(int argc, char *argv[])
{
//freopen("C:\\Users\\Administrator\\Documents\\C-Free\\Projects\\hdu_1070\\input.txt","r",stdin);
int T,n;
cin>>T;
while (T--){
cin>>n;
int i = 0;
while (n--){
cin>>arr[i].s>>arr[i].p>>arr[i].vol;
if (arr[i].vol >= 200){
if (arr[i].vol > 1200) arr[i].l = 5;
else arr[i].l = arr[i].vol / 200;
arr[i].k = arr[i].p / arr[i].l;
i++;
}
}
sort(arr,arr+i,cmp);
cout<<arr[0].s<<endl;
}
return 0;
}
以价格与天数的比当做首要排序条件,当首要条件有相同时以体积作为次要排序条件