CF1371A.Magical Sticks

A penguin Rocher has $n$ sticks. He has exactly one stick with length $i$ for all $1 \le i \le n$.

He can connect some sticks. If he connects two sticks that have lengths $a$ and $b$, he gets one stick with length $a + b$. Two sticks, that were used in the operation disappear from his set and the new connected stick appears in his set and can be used for the next connections.

He wants to create the maximum number of sticks that have the same length. It is not necessary to make all sticks have the same length, some sticks can have the other length. How many sticks with the equal length he can create?

企鹅罗彻有 $n$ 根木棍。对于所有满足 $1 \le i \le n$ 的整数 $i$，他恰好有一根长度为 $i$ 的木棍。

他可以将若干根木棍连接起来。若他将两根长度分别为 $a$ 和 $b$ 的木棍连接起来，则得到一根长度为 $a + b$ 的新木棍。参与此次操作的两根木棍会从他的集合中消失，而新生成的这根连接后的木棍则加入集合，并可用于后续的连接操作。

他希望构造出尽可能多的、长度完全相同的木棍。不要求所有木棍最终长度都相同，允许部分木棍具有其他长度。那么，他最多能构造出多少根长度相等的木棍？

The input consists of multiple test cases. The first line contains a single integer $t$ ($1 \le t \le 1000$) — the number of test cases. Next $t$ lines contain descriptions of test cases.

For each test case, the only line contains a single integer $n$ ($1 \le n \le 10^{9}$).

输入包含多个测试用例。第一行包含一个整数 $t$（$1 \le t \le 1000$），表示测试用例的数量。接下来的 $t$ 行分别描述各测试用例。

对于每个测试用例，唯一的一行包含一个整数 $n$（$1 \le n \le 10^{9}$）。

For each test case, print a single integer — the answer to the problem.

对于每个测试用例，输出一个整数——即该问题的答案。

In the third case, he can connect two sticks with lengths $1$ and $2$ and he will get one stick with length $3$. So, he will have two sticks with lengths $3$.

In the fourth case, he can connect two sticks with lengths $1$ and $3$ and he will get one stick with length $4$. After that, he will have three sticks with lengths ${2, 4, 4}$, so two sticks have the same length, and one stick has the other length.

在第三种情况下，他可以连接两根长度分别为 $1$ 和 $2$ 的木棍，从而得到一根长度为 $3$ 的木棍。因此，他将拥有两根长度均为 $3$ 的木棍。

在第四种情况下，他可以连接两根长度分别为 $1$ 和 $3$ 的木棍，从而得到一根长度为 $4$ 的木棍。之后，他将拥有三根长度分别为 ${2, 4, 4}$ 的木棍，即其中两根长度相同，另一根长度不同。