WUSTOJ 1338: The minimum square sum（Java）

题目链接：1338: The minimum square sum

Description

Given a prime p(p<10⁸), you are to find min{x²+y²}, where x and y belongs to positive integer, so that x²+y²=0 (mod p).

输入一个质数 p，你找出两个正整数 x 和 y 使得 (x²+y²) mod p = 0，且 x²+y² 最小。

Input

Every line is a p. No more than 10001 test cases.

Output

The minimum square sum as described above.

Sample Input

2
3
5
7
11
13

Sample Output

2
18
5
98
242
13

分析