#include <cstdio>
#include <algorithm>
#include <map>
#include <cstring>
#include <cmath>
#include <iostream>
using namespace std;
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
#define LL __int64
#define PI 3.1415926
const int maxn = 1000000;
int a[maxn];
struct node
{
    char name[2222];
    int score;
    int sum;
};
node f[1005];
bool cmp(node aa,node bb)
{
    if(aa.sum==bb.sum)
        return strcmp(aa.name,bb.name)<0;
    else
        return aa.sum>bb.sum;
}
int main()
{

    int t,ans;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        int i,j;
        int max;
        max=-1;
        for(i=0; i<n; i++)
        {
            ans=0;
            cin>>f[i].name>>f[i].score;
            for(j=2; j*j<=f[i].score; j++)
            {
                if(f[i].score&&f[i].score%j==0)
                {
                    ans++;
                    while(f[i].score&&f[i].score%j==0)
                        f[i].score/=j;
                }
            }
            if(f[i].score>1)
                ans++;
            f[i].sum=ans;
        }
        sort(f,f+n,cmp);
        cout<<f[0].name<<endl;
    }
    return 0;
}