F - 2^x mod n = 1

Give a number n, find the minimum x(x>0) that satisfies 2^x mod n = 1.
Input
One positive integer on each line, the value of n.
Output
If the minimum x exists, print a line with 2^x mod n = 1.

Print 2^? mod n = 1 otherwise.

You should replace x and n with specific numbers.
Sample Input
2
5
Sample Output
2^? mod 2 = 1
2^4 mod 5 = 1

对于整数a、p如果存在整数b，满足a*b mod p = 1，则称b是a的模p的乘法逆元。a存在模p的乘法逆元的充要条件是gcd(a,p) = 1此题中，令a = 2^x，b = 1，p = n，则若存在x使得2^x mod N = 1，则gcd(2^x,N) = 1。

  #include<stdio.h>
  #include<algorithm>
 using namespace std;
int main()
{
    int n;
   while (~scanf("%d",&n))
    {
	     if(n%2==0||n==1)
		printf("2^? mod %d = 1\n",n);
	   else
	   {
		int ans=1,t=2;
		while (t%n!=1)
		{
			t=(t*2)%n;
			ans++;
		}
		printf("2^%d mod %d = 1\n",ans,n);
	}
}
return 0;
 }