- All Contests
- ProjectEuler+
- Project Euler #75: Singular integer right triangles

# Project Euler #75: Singular integer right triangles

# Project Euler #75: Singular integer right triangles

_{This problem is a programming version of Problem 75 from projecteuler.net}

It turns out that is the smallest length of wire that can be bent to form an integer sided right angle triangle in exactly one way, but there are many more examples.

In contrast, some lengths of wire, like , cannot be bent to form an integer sided right angle triangle, and other lengths allow more than one solution to be found; for example, using it is possible to form exactly three different integer sided right angle triangles.

Given that is the length of the wire, for how many values of can exactly one integer sided right angle triangle be formed?

**Input Format**

First line contains that denotes the number of test cases. This is followed by lines, each containing an integer, .

**Constraints**

**Output Format**

Print the required answer for each test case.

**Sample Input**

```
2
12
50
```

**Sample Output**

```
1
6
```