1748A - The Ultimate Square - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define MAXN 1001
typedef long long ll;
using namespace std;
int t;
/*
long long n, q;
long long bit[10000001], f[10000001];

ll getSum(ll b, ll c)
{
    ll idx = c, ans = 0;
    while (idx > b){
        ans += bit[idx];
        idx -= (idx & (-idx));
    }
    return ans;
}

void update(ll u, ll v)
{
    ll idx = u;
    while (idx <= n) {
        bit[idx] += v;
        idx += (idx & (-idx));
    }
}
*/
int main()
{
    cin >> t;
    while(t--){
        ll n;
        cin >> n;
        if(n % 2 != 0) cout << n / 2 + 1 << endl;
        else cout << n / 2 << endl;
    }
    return 0;
}