#include <bits/stdc++.h>
using namespace std;
const int Max = 300010;
int n, pos;
int a[Max];
int b[Max];
int main() {
  while (scanf("%d", &n) != -1) {
    memset(b, 0, sizeof(b));
    for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
    }
    printf("1");
    pos = n;
    for (int i = 1; i <= n; i++) {
      b[a[i]] = 1;
      while (b[pos] == 1) {
        pos--;
      }
      printf(" %d", i - (n - pos) + 1);
    }
    printf("\n");
  }
  return 0;
}
