#include <cstdio>

#include <cstring>

using namespace std;

typedef long long ll;

const int N = 1e7 + ;

int testCase, pCnt, pri[N];

ll n, phi[N];

bool np[N];

template <typename T>

inline void read(T &X) {

    X = ; char ch = ; T op = ;

    for(; ch > ''|| ch < ''; ch = getchar())

        if(ch == '-') op = -;

    for(; ch >= '' && ch <= ''; ch = getchar())

        X = (X << ) + (X << ) + ch - ;

    X *= op;

}

void sieve() {

    phi[] = 1LL;

    for(int i = ; i < N; i++) {

        if(!np[i]) pri[++pCnt] = i, phi[i] = i - ;

        for(int j = ; j <= pCnt && i * pri[j] < N; j++) {

            np[i * pri[j]] = ;

            if(i % pri[j] == ) {

                phi[i * pri[j]] = phi[i] * pri[j];

                break;

            }

            phi[i * pri[j]] = phi[i] * (pri[j] - );

        }

    }

}

inline ll pow(ll a, ll b, ll P) {

    ll res = 1LL;

    for(; b > ; b >>= ) {

        if(b & ) res = res * a % P;

        a = a * a % P;

    }

    return res;

}

ll solve(ll now) {

    if(now == ) return ;

    return pow(2LL, phi[now] + solve(phi[now]), now);

}

int main() {

    sieve();

    for(read(testCase); testCase--; ) {

        read(n);

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

    }

    return ;

}