int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int _; for (cin >> _; _--;) {
ll n; cin >> n;
cout << (n + 1) / 2 << "\n";
}
}
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int _; for (cin >> _; _--;) {
ll n, r;
cin >> n >> r;
ll k = min(n - 1, r);
cout << (k + 1) * k / 2 + (r >= n) << "\n";
}
}
void solve() {
ll a, b, n, m;
cin >> a >> b >> n >> m;
cout << (a + b >= n + m and min(a, b) >= m ? "YES\n" : "NO\n");
}
const int maxn = 300;
int A[maxn][maxn];
void solve() {
ll n, k;
cin >> n >> k;
cout << not not(k % n) * 2 << "\n";
for (int i = 0; i < n; i += 1)
for (int j = 0; j < n; j += 1) A[i][j] = 0;
for (int i = 0; i < n; i += 1)
for (int j = 0; j < n; j += 1)
if (k) {
A[j][(i + j) % n] = 1;
k -= 1;
}
for (int i = 0; i < n; i += 1) {
for (int j = 0; j < n; j += 1) cout << A[i][j];
cout << "\n";
}
}