Given an integer N, your task is to count how many right-angled triangles exists with side-lengths a, b and c that satisfied an inequality 1 ≤ a ≤ b ≤ c ≤ N.
Input :
First line will contain an integer T (number of test cases).
Then T lines follows.
Each of the lines contain an integer N.

Output :
For each N print the required answer.

Constraints :
T<=300
N<=300

sample input :

2
5
10

sample output :

1
2

Explanation :
testcase 1 : N=5 , triplets are (3,4,5)
testcase 2 : N=10, triplets are (3,4,5) and (6,8,10)