1241: Crazy tea party
内存限制:128 MB
时间限制:1.000 S
评测方式:文本比较
命题人:
提交:34
解决:24
题目描述
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).
输入
The first line is the amount of tests. Each next line contains one integer n (1<=n<=32767) – the amount of crazy tea participants
输出
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
样例输入 复制
3
4
5
6
样例输出 复制
2
4
6