#pragma comment(linker, "/STACK:1024000000,1024000000")

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<vector>

#include<map>

#include<set>

#include<queue>

#include<stack>

#include<ctime>

#include<iostream>

using namespace std;

typedef long long LL;

const double pi=acos(-1.0),eps=1e-;

void File()

{

    freopen("D:\\in.txt","r",stdin);

    freopen("D:\\out.txt","w",stdout);

}

inline int read()

{

    char c = getchar();  while(!isdigit(c)) c = getchar();

    int x = ;

    while(isdigit(c)) { x = x *  + c - ''; c = getchar(); }

    return x;

}

const int S=;

LL mult_mod(LL a,LL b,LL c)

{

    a%=c; b%=c; LL ret=;

    while(b)

    {

        if(b&){ret+=a;ret%=c;} a<<=;

        if(a>=c)a%=c; b>>=;

    }

    return ret;

}

LL pow_mod(LL x,LL n,LL mod)

{

    if(n==)return x%mod;

    x%=mod; LL tmp=x,ret=;

    while(n)

    {

        if(n&) ret=mult_mod(ret,tmp,mod);

        tmp=mult_mod(tmp,tmp,mod); n>>=;

    }

    return ret;

}

bool check(LL a,LL n,LL x,LL t)

{

    LL ret=pow_mod(a,x,n);

    LL last=ret;

    for(int i=;i<=t;i++)

    {

        ret=mult_mod(ret,ret,n);

        if(ret==&&last!=&&last!=n-) return true;

        last=ret;

    }

    if(ret!=) return true;

    return false;

}

bool Miller_Rabin(LL n)

{

    if(n<)return false;

    if(n==)return true;

    if((n&)==) return false;

    LL x=n-,t=;

    while((x&)==){x>>=;t++;}

    for(int i=;i<S;i++)

    {

        LL a=rand()%(n-)+;

        if(check(a,n,x,t)) return false;

    }

    return true;

}

LL factor[];

int tol;

LL gcd(LL a,LL b)

{

    if(a==)return ;

    if(a<) return gcd(-a,b);

    while(b) { LL t=a%b; a=b; b=t; }

    return a;

}

LL Pollard_rho(LL x,LL c)

{

    LL i=,k=,x0=rand()%x,y=x0;

    while()

    {

        i++;

        x0=(mult_mod(x0,x0,x)+c)%x;

        LL d=gcd(y-x0,x);

        if(d!=&&d!=x) return d;

        if(y==x0) return x;

        if(i==k){y=x0;k+=k;}

    }

}

void findfac(LL n)

{

    if(Miller_Rabin(n)) { factor[tol++]=n; return; }

    LL p=n;

    while(p>=n)p=Pollard_rho(p,rand()%(n-)+);

    findfac(p); findfac(n/p);

}

int T;

LL x,ans;

int main()

{

    srand(time(NULL)); scanf("%d",&T);

    while(T--)

    {

        scanf("%lld",&x);

        if(x==) {printf("3\n"); continue;}

        if(x==) {printf("2\n"); continue;}

        if(x==) {printf("1\n"); continue;}

        LL n=(LL)sqrt(1.0*x);

        ans=x;

        for(LL i=n;i>=;i--)

        {

            tol=; findfac(i); sort(factor,factor+tol);

            bool fail=; for(int j=;j<tol-;j++) if(factor[j]==factor[j+]) fail=;

            if(fail==) continue;

            else { ans=abs(x-i*i); break;}

        }

        for(LL i=n+;;i++)

        {

            tol=; findfac(i); sort(factor,factor+tol);

            bool fail=; for(int j=;j<tol-;j++) if(factor[j]==factor[j+]) fail=;

            if(fail==) continue;

            else { ans=min(ans,abs(x-i*i)); break;}

        }

        printf("%lld\n",ans);

    }

    return ;

}