#include <bits/stdc++.h>
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long countDivisor(long long n) {
  long long divisor = 0;
  for (long long i = 1; i * i <= n; i++) {
    if (i * i == n)
      divisor += 1;
    else if (n % i == 0)
      divisor += 2;
  }
  return divisor;
}
int bmod(int a, int b, int m) {
  if (b == 0) return 1;
  int x = bmod(a, b / 2, m);
  x = (x * x) % m;
  if (b % 2 == 1) x = (x * a) % m;
  return x;
}
long long powr(long long n, long long m) {
  long long ans = 1;
  for (long long i = 1; i <= m; i++) ans *= n;
  return ans;
}
bool prime(long long n) {
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
int Setbit(long long N, long long pos) { return N = N | (1 << pos); }
int resetbit(long long N, long long pos) { return N = N & ~(1 << pos); }
bool checkbit(long long N, long long pos) { return (bool)(N & (1 << pos)); }
long long fx[8] = {0, +0, -1, +1, +1, -1, -1, +1};
long long fy[8] = {1, -1, +0, +0, +1, +1, -1, -1};
using namespace std;
long long arr[500005], flag[500005];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n;
  cin >> n;
  for (long long i = 0; i < n; i++) cin >> arr[i];
  long long ans, ptr = n, ct = 0;
  cout << 1 << ' ';
  for (long long i = 0; i < n; i++) {
    if (arr[i] < ptr) ct++;
    flag[arr[i]] = 1;
    if (arr[i] == ptr) {
      while (flag[ptr] != 0) {
        ptr--;
        if (flag[ptr] == 1) ct--;
      }
    }
    cout << ct + 1 << ' ';
  }
}
