#include <bits/stdc++.h>
std::priority_queue<int> q, t;
const int MAXN = 3e5 + 10;
int n;
int last;
bool vis[MAXN];
int main() {
  scanf("%d", &n);
  last = n;
  int ans = 1;
  printf("1");
  for (int i = 1; i <= n; i++) {
    int tmp;
    scanf("%d", &tmp);
    vis[tmp] = true;
    ans++;
    while (vis[last]) {
      last--;
      ans--;
    }
    printf(" %d", ans);
  }
  putchar('\n');
  return 0;
}
