Mad Tea Party#2334
participants in a "mad tea party" are sitting around a table. Every minute, one pair of neighboring participants at the table can swap places. Find the minimum time (in minutes) required so that all participants are seated in the reverse order (that is, each left neighbor has swapped to the right, and each right neighbor to the left).
The first line of the input file contains the number of tests.
Each of the following lines contains one integer (1 \leq N \leq 32767) — the number of participants in the mad tea party.
For each , output on a separate line the minimum time required for all participants to be seated in reverse order.
Example 1