#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int *p = new int[n];
  int *d = new int[n];
  memset(d, 0, (n) * sizeof(*d));
  for (int i = 0; i < n; i++) {
    cin >> p[i];
  }
  cout << 1 << " ";
  int sum = 0, k1n = 0, konec = n - 1, k1k = 0;
  for (int i = 0; i < n; i++) {
    sum = 0;
    d[p[i] - 1] = 1;
    k1n++;
    if (p[i] - 1 == konec)
      for (int j = konec; j >= 0; j--) {
        if (d[j] == 1)
          k1k += 1;
        else {
          konec = n - 1 - k1k;
          break;
        }
      }
    sum = k1n + 1 - k1k;
    cout << sum << " ";
  }
}
