#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
struct milk
{
char a[105];
int p, v;
double s;
}run[105];
int cmp(const void *a, const void *b)
{
struct milk *A = (milk *) a;
struct milk *B = (milk *) b;
if(A->s == B->s)
return B->p - A->p;
else
return A->s - B->s;
}
int main()
{
int t;
scanf("%d", &t);
while(t--)
{
int n, i;
scanf("%d", &n);
for(i = 0; i < n; i++)
{
getchar();
scanf("%s%d%d", run[i].a, &run[i].p, &run[i].v);
if(run[i].v >= 1000)
run[i].s = (double)run[i].p / 5.0;
else
{
if(run[i].v / 200 == 0)
run[i].s = 100000000;
else
run[i].s = (double)run[i].p / (double)(run[i].v / 200);
}
}
qsort(run, n, sizeof(run[0]), cmp);
printf("%s\n", run[0].a);
}
return 0;
}