Crazy Tea Party

The $n$ participants of the "crazy tea party" sit around a round table. Each minute, one pair of adjacent neighbours may swap places. Find the minimum time (in minutes) required for all participants to sit in the reverse order, so that each participant's left neighbour becomes their right neighbour and their right neighbour becomes their left.

The first line contains the number of tests. Each of the next lines contains one integer $n$ ($1 \le n \le 32767$) — the number of crazy-tea participants.

For each number $n$ of participants, print on its own line the minimum time required for all participants to sit in the reverse order.