#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T abs(T t) {
  return t < 0 ? -t : t;
}
const long long modn = 1000000007;
inline long long mod(long long x) { return x % modn; }
const int MAXN = 312345;
int n, m, k;
int s[MAXN], mrk[MAXN];
int main() {
  scanf("%d", &n);
  for (int a = 0; a < n; a++) {
    scanf("%d", s + a);
  }
  int ult = n + 1;
  int res = 1;
  printf("1 ");
  for (int i = 0; i < n; i++) {
    res++;
    mrk[s[i]] = 1;
    while (ult > 0 && mrk[ult - 1] == 1) {
      ult--;
      res--;
    }
    printf("%d ", res);
  }
  puts("");
}
