1290 : 2^x mod n = 1

时间限制:1 Sec 内存限制:128 MiB
提交:44 答案正确:22

提交 状态 讨论区

题目描述

Give a number n, find the minimum x(x>0) that satisfies 2^x mod n = 1.

输入

One positive integer on each line, the value of n.

输出

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.


样例输入

复制
2
5

样例输出

复制
2^? mod 2 = 1
2^4 mod 5 = 1

提示


			

来源

WX