#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e9 + 5;
const long long MOD = 2147483648;
const int INF = 0x3f;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long qpw(long long a, long long b, long long p) {
  a %= p;
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % p;
    a = a * a % p;
    b >>= 1;
  }
  return ans % p;
}
int cc;
int main() {
  cin >> cc;
  while (cc--) {
    long long n;
    cin >> n;
    cout << n / 2 + 1 << endl;
  }
  return 0;
}
