#include <bits/stdc++.h>
using namespace std;
const double eps = 0.000001;
const long double pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const long long MOD = 1e18 + 9;
const long long INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 5e3 + 123;
const int NN = 5e5 + 123;
const int PRI = 555557;
const int pri = 997;
int tests = 1;
int n, m, k, a[NN], cnt, ans, x, pos;
string s;
inline void Solve() {
  cin >> n;
  pos = n;
  cout << 1 << ' ';
  for (int i = 1; i <= n; i++) {
    cin >> x;
    a[x] = 1;
    while (a[pos]) pos--;
    cout << i - (n - pos) + 1 << ' ';
  }
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  while (tests--) {
    Solve();
  }
}
