#include <bits/stdc++.h>
using namespace std;
int n, q = 524288, p, ans = 1, lz;
int s[1048576], r[1048576];
int getsum(int t) {
  if (t >= q) {
    if (r[t] > lz - q) {
      return 0;
    } else {
      return s[t];
    }
  }
  if (r[t] <= lz - q) {
    return s[t];
  } else if (r[t * 2] <= lz - q) {
    return s[t * 2] + getsum(t * 2 + 1);
  } else {
    return getsum(t * 2);
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  cout << 1 << endl;
  lz = n - 1 + q;
  for (int i = q; i < 2 * q; i++) {
    r[i] = i - q;
  }
  for (int i = q - 1; i > 0; i--) {
    r[i] = r[i * 2 + 1];
  }
  for (int i = 0; i < n; i++) {
    cin >> p;
    p--;
    p += q;
    while (p > 0) {
      s[p] += 1;
      p /= 2;
    }
    while (s[lz]) lz--;
    cout << getsum(1) + 1 << endl;
  }
  return 0;
}
