Vibhav is a third year student mentor. One of his mentee is very frustrated due to the M2 assignments. He almost completed his last assignment except for one question. He tried a lot but was unable to solve it. At last he asked Vibhav for help. But it turns out that Vibhav is currently busy with his Software lab evaluations. Vibhav doesn’t want to turn down his mentee, so he comes to you.
	The question is as follows:
There is an infinite plane containing ‘n’ lines. These lines are arranged such that they form maximum territories. One more condition given is that these Lines are placed only at inclination integral multiple of 1o from each other. A territory is a 2d region bounded by lines or end of the plane. Given ‘t’ different values of ‘n’. Find  the total number of such territories enclosed for each ‘n’. 

Input:
First line of each test case consists of an integer representing ‘t’.
Next ‘t’ lines contain single integer denoting value of ‘n’.

Output:
Output cosists of ‘t’ lines each containing a single integer denoting the number of territories enclosed.

Constraints:
1 < n < 10000000000
1 < t < 1000000