13:I[87,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"Header"] 14:I[1742,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"ProblemView"] 15:T73c,

You are given a multiset $$$S$$$. Initially, $$$S = \{1,2,3, \ldots, n\}$$$.

You will perform the following operation $$$n-1$$$ times.

Choose the largest number $$$S_{\text{max}}$$$ in $$$S$$$ and the smallest number $$$S_{\text{min}}$$$ in $$$S$$$. Remove the two numbers from $$$S$$$, and add $$$S_{\text{max}} - S_{\text{min}}$$$ into $$$S$$$.

It's easy to show that there will be exactly one number left after $$$n-1$$$ operations. Output that number.

Input

Each test contains multiple test cases. The first line contains a single integer $$$t$$$ ($$$1 \le t \le 10^5$$$) — the number of test cases. Their description follows.

For each test case, one single line contains a single integer $$$n$$$ ($$$2 \le n \le 10^9$$$) — the initial size of the multiset $$$S$$$.

Output

For each test case, output an integer denoting the only number left after $$$n-1$$$ operations.

Last Number

Examples