\textbf{N} participants in the "mad tea party" sit around the table. Every minute, one pair of neighbors in the table can be swapped. Find the minimum time (in minutes) necessary to ensure that all participants in tea parties were transferred in the reverse order (ie, the left neighbor should be a right, and right - left). \InputFile The input file in the first line contains the number of tests. Each subsequent line contains one integer \textbf{N} (\textbf{1} ≤ \textbf{N} ≤ \textbf{32767}) - the number of participants in a mad tea party. \OutputFile In the output file display on a separate line for each number \textbf{N} of the minimum time required for the transplantation of all \textbf{N} participants.