Tianjin University Online Judge
Contests Virtual Contests Problems Submit Runs Status Rank List Forum

1680.   Crazy tea party
Time Limit: 1.0 Seconds   Memory Limit: 65536K
Total Runs: 1738   Accepted Runs: 1073



n participants of "crazy tea party" sit around the table. Each minute one pair of neighbors can change their places. Find the minimum time (in minutes) required for all participants to sit in reverse order (so that left neighbors would become right, and right - left).

Input

The first line is the amount of tests. Each next line contains one integer n (1 ≤ n ≤ 32767) - the amount of crazy tea participants.

Output

For each number n of participants to crazy tea party print on the standard output, on a separate line, the minimum time required for all participants to sit in reverse order.


Sample Input

3
4
5
6


Sample Output

2
4
6



Source: Southeastern European 2003
Submit   List    Runs   Forum   Statistics

Tianjin University Online Judge v1.3.0
Maintance:Fxz. Developer: SuperHacker, G.D.Retop, Fxz