#include<iostream>
#include<cstdio>
#include<stack>
#include<string.h>
#include<math.h>
using namespace std;
typedef __int64 LL;
#define N 100005
LL gcd(LL a,LL b)
{
return b==0?a:gcd(b,a%b);
}
LL euler(LL x)
{
LL res=x,i;
for(i=2; i*i<=x; i++)
{
if(x%i==0)
{
res=res/i*(i-1);
while(x%i==0) x/=i;
}
}
if(x>1) res=res/x*(x-1);
return res;
}
LL pow(LL a,LL d)
{
LL r=1,p=2;
while(a)
{
if(a&1) r=(r*p)%d;
p=(p*p)%d;
a>>=1;
}
return r%d;
}
int judge(LL a,LL d)
{
LL res;
res=pow(a,d);
if(res%d==1) return 1;
return 0;
}
stack<LL> w;
LL yin(LL x,LL d)
{
int f=0;
LL i,res=x,y=x,m;
while(!w.empty()) w.pop();
m=sqrt(double(y)+0.5);
for(i=1; i<=m; i++)
{
if(x%i==0)
{
if(judge(i,d))
{
f=1;
res=i;
break;
}
w.push(x/i);
}
}
while(!f&&!w.empty())
{
i=w.top();
w.pop();
if(judge(i,d))
{
f=1;
res=i;
break;
}
}
return res;
}
int main()
{
LL x,d,res,n;
while(~scanf("%I64d",&n))
{
if(n==1||n%2==0)
{
printf("2^? mod %I64d = 1\n",n); continue;
}
x=euler(n);
res=yin(x,n);
printf("2^%I64d mod %I64d = 1\n",res,n);
}
return 0;
}