#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;
const int MAX = 5e5;
int n,a[N],dp[N],par[MAX],sz[MAX];
bool f[MAX];

void make_set(int v) {
    par[v] = v;
    sz[v] = 1;
}

int find_set(int v) {
    if (v == par[v]) return v;
    int p = find_set(par[v]);
    par[v] = p;
    return p;
}

void union_sets(int a,int b) {
    a = find_set(a),b = find_set(b);
    if (a == b) return;
    if (sz[a] < sz[b]) swap(a,b);
    sz[a] += sz[b];
    par[b] = a;
}

void solve() {
    int ans = 0;
    for (int i = 0; i <= MAX; i++) make_set(i);
    for (int i = 1; i <= n; i++) {
        if (!f[a[i]]) {
            f[a[i]] = true;
            ans++;
            if (f[a[i] - 1]) {
                ans += (sz[find_set(a[i])] + sz[find_set(a[i] - 1)] + 1) / 2;
                ans -= (sz[find_set(a[i])] + 1) / 2;
                ans -= (sz[find_set(a[i] - 1)] + 1) / 2;
                union_sets(a[i],a[i] - 1);
            }
            if (f[a[i] + 1]) {
                ans += (sz[find_set(a[i])] + sz[find_set(a[i] + 1)] + 1) / 2;
                ans -= (sz[find_set(a[i])] + 1) / 2;
                ans -= (sz[find_set(a[i] + 1)] + 1) / 2;
                union_sets(a[i],a[i] + 1);
            }
        }
        cout << ans << "\n";
    }
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i];
    solve();
}