#include <bits/stdc++.h>
using namespace std;
const double PI = acos(0) * 2;
const double EPS = 1e-8;
const long long MOD = 1e9 + 7;
const int MAXN = 3e5 + 5;
const int oo = 1e9;
const double foo = 1e30;
template <class T>
int getbit(T s, int i) {
  return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
  return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
  return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
  return __builtin_popcounll(s);
}
template <class T>
T sqr(T x) {
  return x * x;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
int vs[MAXN * 2];
int a[MAXN], n;
int main() {
  cin >> n;
  long long ans = 0;
  cout << 1 << " ";
  int find = n + 1;
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    vs[a[i]] = 1;
    while (find - 1 >= 1 && vs[find - 1]) find--;
    if (find == n + 1) {
      printf("%d ", i + 2);
    } else {
      if (find == 1) {
        printf("1 ");
      } else {
        int rem = (i + 1) - (n - find + 1) + 1;
        printf("%d ", rem);
      }
    }
  }
  return 0;
}
