You are given a multiset $$$S$$$. Initially, $$$S = \{1,2,3, \ldots, n\}$$$.
You will perform the following operation $$$n-1$$$ times.
It's easy to show that there will be exactly one number left after $$$n-1$$$ operations. Output that number.
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$$$.
For each test case, output an integer denoting the only number left after $$$n-1$$$ operations.
524715177567
1 2 2 4 33914
We show how the multiset $$$S$$$ changes for $$$n=4$$$.
Thus, the answer for $$$n = 4$$$ is $$$2$$$.
Name |
---|