A double-square number is an integer

**X**which can be expressed as the sum of two perfect squares. For example, 10 is a double-square because 10 = 3^{2}+ 1^{2}. Your task in this problem is, given**X**, determine the number of ways in which it can be written as the sum of two squares. For example, 10 can only be written as 3^{2}+ 1^{2}(we don’t count 1^{2}+ 3^{2}as being different). On the other hand, 25 can be written as 5^{2}+ 0^{2}or as 4^{2}+ 3^{2}.### Input

You should first read an integer **N**, the number of test cases. The next **N** lines will contain **N** values of **X**.

### Constraints

0 ≤ **X** ≤ 2147483647

1 ≤ **N** ≤ 100

### Output

For each value of **X**, you should output the number of ways to write **X** as the sum of two squares.

Example input

5

10

25

3

0

1

10

25

3

0

1

Example output

1

2

0

1

1

2

0

1

1

That 2nd task have a lot of text and i don’t have any wish to read it whole.

Copy text from .txt file to .doc file or any other one and you will have proper lines

Also, that task with text – do not copy numbers inside (you will get wrong answer)

Goran

Share this, they like shareing

http://www.mediafire.com/?pidg989pf6pik11

Copy text from .txt file to .doc file or any other one and you will have proper lines

Also, that task with text – do not copy numbers inside (you will get wrong answer)

Goran

Share this, they like shareing

http://www.mediafire.com/?pidg989pf6pik11