#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<long long> a(n), v(n, 0);
  for (auto &s : a) scanf("%lld", &s);
  int r_pos = n - 1;
  int cnt = 0;
  cout << 1 << " ";
  for (int i = 0; i < n; i++) {
    cnt++;
    v[a[i] - 1] = 1;
    while (r_pos >= 0 && v[r_pos] == 1) {
      r_pos--;
    }
    if (r_pos == -1) {
      cout << "1 ";
    } else {
      cout << cnt - (n - r_pos - 1) + 1 << " ";
    }
  }
}
int main() {
  int t = 1;
  while (t--) solve();
}
