Magical Sticks

题意翻译

你有 $n$ 根长度分别为 $1,2,3,\cdots,n$ 的棍子。你可以进行任意次操作，每次可以选择两根长度为 $x,y$ 的棍子，将它们拼接得到一根长度 $x+y$ 的棍子。这根棍子可以继续用来拼接。 你需要求出在经过一系列操作后，最多可能有多少根棍子长度相等。 多组数据，数据组数 $t \leq 1000$，$1 \leq n \leq 10^9$ 翻译 by Meatherm

题目描述

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?

输入输出格式

输入格式

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} $ ).

输出格式

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

输入输出样例

输入样例 #1

4
1
2
3
4

输出样例 #1

1
1
2
2

说明

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.