1136-2^x mod n = 1 ZCMU

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

解析

2的x幂次有可能会使数据溢出，所以在每次查找结束后要对数据进行一次处理

代码

#include<bits/stdc++.h>
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 item=1;
           for(int i=1;;i++)
           {
               item*=2;
               if(item%n==1)
               {
                 printf("2^%d mod %d = 1\n",i,n);
                 break;
               }
               item%=n;
           }
       }
    }
    return 0;
}