#include <bits/stdc++.h>
using namespace std;
long long int bigmod(long long int a, long long int p, long long int m) {
  long long int result = 1;
  long long int x = a;
  while (p) {
    if (p & 1) {
      result = (result * x) % m;
    }
    x = (x * x) % m;
    p = p >> 1;
  }
  return result;
}
int main() {
  long long int t, nab, nbc, nca, n, m, i, j;
  long long int d, a, b, c;
  scanf("%I64d", &t);
  while (t--) {
    cin >> n;
    if (n == 1)
      cout << "1";
    else
      cout << (n / 2) + 1;
    printf("\n");
  }
  return 0;
}
