Algorithm


A. Magical Sticks
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

A penguin Rocher has n sticks. He has exactly one stick with length i for all 1in1≤�≤�.

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?

Input

The input consists of multiple test cases. The first line contains a single integer t (1t10001≤�≤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 (1n1091≤�≤109).

Output

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

Example
input
Copy
4
1
2
3
4
output
Copy
1
1
2
2
Note

In the third case, he can connect two sticks with lengths 11 and 22 and he will get one stick with length 33. So, he will have two sticks with lengths 33.

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

 



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include<bits/stdc++.h>
using namespace std;

int main(){
  int t;
  cin>>t;
  int n;
  while(t--){
    cin>>n;
    cout<<((n-1)/2 + 1)<<endl;
  }
  return 0;
}
Copy The Code & Try With Live Editor

Input

x
+
cmd
4
1
2
3
4

Output

x
+
cmd
1
1
2
2
Advertisements

Demonstration


Codeforcess solution 1371-A A. Magical Sticks ,C++, Java, Js and Python,1371-A,Codeforcess solution

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+