#include <bits/stdc++.h>
using namespace std;
vector<int> noprimes(1000001);
void seive(vector<int> &primes, int n) {
  vector<bool> ntprimes(n + 1, false);
  ntprimes[0] = ntprimes[1] = true;
  for (int i = 2; i * i <= n; i++) {
    if (!ntprimes[i]) {
      for (int j = i * i; j <= n; j += i) {
        ntprimes[j] = true;
      }
    }
  }
  int x = 0;
  for (int i = 2; i <= n; i++) {
    if (!ntprimes[i]) {
      primes.push_back(i);
      x++;
      noprimes[i] = x;
    } else
      noprimes[i] = x;
  }
}
long long pow(long long x, long long n) {
  long long res = 1;
  while (n) {
    if (n % 2 == 0) {
      n = n / 2;
      x = x * x;
    } else {
      res *= x;
      n--;
    }
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  vector<int> A(n + 1);
  vector<int> mark(n + 1);
  int l = n;
  cout << 1 << " ";
  for (int i = 1; i < n + 1; i++) {
    cin >> A[i];
    mark[A[i]]++;
    for (; l >= 0; l--) {
      if (mark[l] == 0) break;
    }
    cout << i - (n - l) + 1 << " ";
  }
  return 0;
}
