ZaakDov is doing his math problem!

问题描述 :

Given an odd prime p.
You are to tell whether p can be written into form a^2+b^2 (0<a<=b),
and if p can be done, you are to determine a pair of a,b.
输入:

There will be up to 2*10^5 test cases.
An odd prime p (3<=p<2*10^9) in each line.
End with EOF.
输出:

There will be up to 2*10^5 test cases.
An odd prime p (3<=p<2*10^9) in each line.
End with EOF.
样例输入:

3
5
7
11
13
17
19
23
29
样例输出:

Illegal
Legal 1 2
Illegal
Illegal
Legal 2 3
Legal 1 4
Illegal
Illegal
Legal 2 5