Odd Pairs

Given an integer $N$, determine the number of pairs $(A, B)$ such that: - $1 \leq A, B \leq N$; - $A + B$ is **odd**. ### Input - 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 For each test case, output the number of required pairs. ### Constraints - $1 \leq T \leq 100$ - $1 \leq N \le