Vikki Sir and The Saar were fighting to prove that one is better programmer than other. The Saar challenges Vikky sir to solve a problem and if he solves it then he will be victorious else he will loose to the Saar. Since Vikky sir is no match for The Saar so he comes to you for help. Please Help !!!!
The Saar gives a number N and asks to find the minimum value of: x1/x2+x2/x3+x3/x4+x4/x5+.......+xn−1/xn+xn/x1
where x1,x2,......xn are real positive
Note: It can be proved that answer is an integer.
Input Format
First line consists of a number t i.e. number of testcases
Next t lines contains the number n as described above
Output Format
For each testcase, output a single line containing the minimum value of above expression
Constraints
1<=t<=10^6,
2<=n<=10^6
