## Problem Description

this month, lucifer made lots of money by selling oranges, so she wants to BG her friends. Tonight, she invites n people. when all get seated around the round table, she finds this table too big for her to get food across the table. so she came up with an idea of a interesting game. Each minute one pair of neighbors can change their places. Find the minimum time (in minutes) required for all lucifer's friends to sit in reverse order (so that left neighbors would become right, and right - left).
lucifer will invite the one who is the first to find the solution to the World cyber Game(WCG) in Chengdu this year.
## Input

The first line is the amount of tests. Each next line contains one integer n (1 <= n <= 32767) - the amount of lucifer's friends.

## Output

For each number n people print on the standard output, on a separate line, the minimum time required for all her friends to sit in reverse order.
## Sample Input

3
4
5
6

## Sample Output

2
4
6

## Source

FOJ月赛-2009年3月--- lucifer