1293: 2^x mod n = 1

Description

Give a number n, find the minimum x 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

HINT

#include<stdio.h>
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
	int a=2,i=1;
	if(n==1||n%2==0)
	{
		printf("2^? mod %d = 1\n",n);
		continue;
	}
	
		while(a!=1)
	{
	   	i++;
	   	a*=2;     
	   	a%=n; //刚开始少了该步骤而导致提交超时  
	}
	printf("2^%d mod %d = 1\n",i,n);		
	}
	
	return 0;
}

一开始使用pow函数  发现也一直超时

pow是函数，传递参数，调用函数的代价远大于直接相乘。
并且，调用函数破坏了cpu的分支预测和缓存优化