At school, Aziz was assigned to write an essay. The deadline was approaching, and Aziz still hadn't written anything. However, he remembered that his friend Barış had already completed the same assignment last year and decided to use it to his advantage.
Aziz didn't want the plagiarism detection system to identify the borrowing, so he came up with a trick: reversing the words in all the sentences of Barış's essay. After this, Aziz decided to calculate the difference between the original sentence and the one he created.
Barış's essay consists of sentences. Each sentence includes unique words. If the number of words in a sentence is denoted as , the original sentence can be represented as the sequence \{1, 2,..., n\}. Aziz's version of the sentence will then be represented as the sequence \{n, n - 1,..., 1\}.
The difference between the original sentence and Aziz's version is calculated as the sum of the absolute differences between the positions of each word in Barış's sentence and the positions of the same word in Aziz's sentence.
For example, if a sentence consists of three words and Barış's sentence is represented as \{1, 2, 3\}, Aziz's sentence will be \{3, 2, 1\}. In this case, the difference between the sentences will be:
The first line contains one integer t~(1 \le t \le 10^5) — the number of sentences in Barış's essay. Each of the following lines contains one integer n_i~(1 \le n_i \le 10^9) — the number of words in the -th sentence.
For each sentence, print the difference between Barış's and Aziz's sentences on a separate line.
Example 1