#include<bits/stdc++.h>
#define ll long long
using namespace std;
vector<ll> prime;
vector<ll> vis(1e8+5,0);
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);


    for(ll k=2;k<=1e8+4;k++)
    {
        if(!vis[k]) prime.push_back(k);
        for(ll i=0;i<prime.size()&&prime[i]*k<=1e8+2;i++)
        {
            vis[k*prime[i]]=prime[i];
            if(k%prime[i]==0) break;
        }
    }


    ll t;
    cin>>t;
    while(t--)
    {
        ll n;
        cin>>n;
        ll ans=0;
        while(vis[n])
        {
            ans^=vis[n];
            n/=vis[n];
        }
        ans^=n;
        cout<<ans<<"\n";
    }
    return 0;
}