pf

#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 1000005
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "perfect"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;

int n, m;
vector<int> perfect;
int sG[N];

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        freopen(Task".out","w",stdout);
    }
    cin >> m;
}

void preproc()
{
    memset(sG, 0, sizeof sG);
    perfect.clear();
    for(int i=1; i<=1e6; i++)
    {
        if (sG[i]==i) perfect.push_back(i);
        for(int j=i+i; j<=1e6; j+=i) sG[j] += i;
    }
}

int bs(int l, int r, int val)
{
    int mid;
    while (r - l > 1)
    {
        mid = (r+l)/2;
        if (perfect[mid] <= val){
            l = mid;
        }
        else{
            r = mid-1;
        }
    }
    if (perfect[r] <= val) return perfect[r];
    return perfect[l];
}

void proc()
{
    while (m--)
    {
        cin >> n;
        int pos = upper_bound(perfect.begin(),perfect.end(),n)-perfect.begin()-1;
        cout << perfect[pos] << endl;
        // cout << bs(0,3,n) << endl;
    }
}

signed main()
{
    readfile();
    preproc();
    proc();
    return 0;
}