**Mock CCC Contest 2 Problem 2 - Crossing** ***N*** Poles are arranged in a line, numbered from **1** to ***N***. The poles are to be wired together such that each pole may only be wired with up to one other pole. A crossing is defined as two wires connecting poles `i` and `j` and poles `x` and `y` such that `(1 ≤ i %lft% x %lft% j %lft% y ≤ N)`. For ***T*** test cases, determine the maximal number of crossings that can exist with a valid wiring. **Constraints** `1 ≤ T ≤ 10^5` `1 ≤ N ≤ 10^9` *Subtask 1 [15%]* `1 ≤ T ≤ 5 * 10^3` `1 ≤ N ≤ 10` *Subtask 2 [15%]* `1 ≤ N ≤ 80` *Subtask 3 [70%]* No additional constraints. **Input Specification** The first line of input will contain one integer ***T***. The next ***T*** lines will contain one integer ***N***. **Output Specification** For each test case, output the maximal number of crossings that can exist with a valid wiring. **Sample Input** ``` 2 5 6 ``` **Sample Output** ``` 1 3 ``` **JAVA, C++: 3.0s** **PYTHON: 5.0s** **Memory: 256mb**