#include <bits/stdc++.h>
int dx[] = {-1, -1, -1, 0, 1, 1, 1, 0};
int dy[] = {-1, 0, 1, 1, 1, 0, -1, -1};
using namespace std;
long long power(long long a, long long p, long long M) {
  long long r = 1;
  a = a % M;
  while (p > 0) {
    if (p % 2) r = (r * a) % M;
    a = (a * a) % M;
    p /= 2;
  }
  return r;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int n;
long long arr[(int)3e5 + 5];
bool f[(int)3e5 + 5];
void solve() {
  cin >> n;
  cout << 1 << " ";
  int j = n;
  for (long long i = 1; i < n + 1; i++) {
    int x;
    scanf("%d", &x);
    f[x] = 1;
    while (f[j]) j--;
    cout << 1 + i - (n - j) << " ";
  }
  cout << endl;
}
int main() {
  solve();
  return 0;
}
