#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main(){
    vector<long long> A;
    for(long long i = 2; 1000000 > i; i++){
        long long nw = i*i;
        while(1000000000000000000/i >= nw){
            nw *= i;
            if((long long)sqrt(nw) * (long long)sqrt(nw) == nw)continue;
            A.push_back(nw);
        }

    }
    sort(A.begin(),A.end());
    A.erase(unique(A.begin(),A.end()),A.end());
    
    int t;cin>>t;
    for(int i = 0; t > i; i++){
        long long x;cin>>x;
        long long mn = 0;
        long long mx = A.size()+1;
        while(mx-mn > 1){
            long long ce = (mx+mn)/2;
            long long ele;
            if(ce == 0){
                ele = 0;
            }else if(ce == A.size()){
                ele = 1000000000+ce-1;
            }else{
                ele = ce+(long long)sqrt(A[ce-1]);
            }
            if(ele <= x){
                mn = ce;
            }else{
                mx = ce;
            }
        }
        //cout << mn << endl;
        if(mn && mn+(long long)sqrt(A[mn-1]) == x){
            //cout << "!!" << endl;
            cout << A[mn-1] << endl;
        }else{
            long long diff = x-(mn+(long long)sqrt(A[mn-1]));
            long long re = sqrt(A[mn-1])+diff;
            cout << re*re << endl;
        }
    }
}