#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<queue>
#include<cstdlib>
#include<ctime>
typedef long long ll;
using namespace std;
int T,p;
inline int phi(int x)
{
int ans=x,now=x;
for(int i=2;i*i<=now;i++)
{
if(now%i==0)
{
ans=ans/i*(i-1);
while(now%i==0)now/=i;
}
}
if(now>1)
{
ans=ans/now*(now-1);
}
return ans;
}
inline int ksm(ll a,int b,int M)
{
ll ans=1;
while(b)
{
if(b&1)ans=(ans*a)%M;
a=(a*a)%M;
b>>=1;
}
return ans;
}
inline int solve(int p)
{
if(p==1)return 0;
int tmp=0;
while(!(p&1)){
tmp++;p>>=1;
}
int phi_p=phi(p);
int ans=solve(phi_p);
ans=(ans-tmp%phi_p+phi_p)%phi_p;
ans=ksm(2,ans,p)%p;
return ans<<tmp;
}
int main()
{
cin>>T;
while(T--)
{
cin>>p;
cout<<solve(p)<<endl;
}
return 0;
}