#include <bits/stdc++.h>
using namespace std;
int p[400000];
int a[400000];
int main() {
  int n, x, i;
  cin >> n;
  int max = n - 1;
  for (i = 0; i < n; i++) {
    cin >> x;
    p[i] = x - 1;
  }
  cout << 1 << ' ';
  for (i = 0; i < n; i++) {
    a[p[i]] = 1;
    if (p[i] == max) {
      while ((max >= 0) and a[max] == 1) {
        max--;
      }
    }
    cout << i + 1 - (n - 1 - max) + 1 << ' ';
  }
  return 0;
}
