#include <bits/stdc++.h>
const long long INF = (long long)1e9;
using namespace std;
long long power(long long x, long long y) {
  long long res = 1;
  x = x % 1000000007;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = ((res % 1000000007) * (x % 1000000007)) % 1000000007;
    y = y >> 1;
    x = ((x % 1000000007) * (x % 1000000007)) % 1000000007;
  }
  return res;
}
vector<long long> pr;
void sieve(long long n) {
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));
  for (long long p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (long long i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
  for (long long i = 2; i <= n; i++)
    if (prime[i]) pr.push_back(i);
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void reduce_to_zero() {
  long long range = 100, add = 0;
  long long x = 1;
  while (range) {
    add += min(range, x);
    x;
    range -= min(x, range);
  }
}
const long long N = 1e6 + 100;
long long fact[N], modulo = INF + 7;
long long binpow(long long val, long long deg, long long modi) {
  if (!deg) return 1 % modi;
  if (deg & 1) return binpow(val, deg - 1, 1000000007) * val % modi;
  long long res = binpow(val, deg >> 1, modi);
  return (res * res) % modi;
}
void initfact() {
  fact[0] = 1;
  for (long long i = 1; i < N; i++) {
    fact[i] = (fact[i - 1] * i);
    fact[i] %= modulo;
  }
}
long long getC(long long n, long long i) {
  long long res = fact[n];
  long long div = fact[n - i] * fact[i];
  div %= modulo;
  div = binpow(div, modulo - 2, modulo);
  return (res * div) % modulo;
}
void we_have_choices() {
  long long n;
  cin >> n;
  cout << (n + 1) / 2 << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr);
  ;
  long long t;
  cin >> t;
  while (t--) we_have_choices();
  return 0;
}
