Given an integer N, determine the number of pairs (A, B) such that:

1 ≤ A, B ≤ N;
A + B is odd.

------ Input Format ------

• The first line of input will contain a single integer T, denoting the number of test cases.
• Each test case consists of a single integer N.

------ Output Format ------

For each test case, output the number of required pairs.

------ Constraints ------

$1 ≤ T ≤ 100$
$1 ≤ N ≤ 10^{9}$

----- Sample Input 1 ------
5
1
2
3
100
199

----- Sample Output 1 ------
0
2
4
5000
19800

----- explanation 1 ------
Test case $1$: There are no pairs satisfying the given conditions.

Test case $2$: The pairs satisfying both conditions are: $(1, 2)$ and $(2, 1)$.

Test case $3$: The pairs satisfying both conditions are: $(1, 2), (2, 1), (2, 3),$ and $(3, 2)$.

见题面

见题面