#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back

const int mxN = 1e6 + 5;
ll n,a[mxN];
bool vis[mxN];
struct ds{
	vector<ll> par,siz;
	
	void init(){
		par.resize(mxN);
		siz.assign(mxN, 1LL);
		for(int i = 1; i < mxN; i++) par[i] = i;
	}
	
	ll find(ll a){
		if(par[a] == a) return a;
		par[a] = find(par[a]);
		return par[a];
	}
	
	void merge(ll a, ll b){
		ll p1 = find(a), p2 = find(b);
		if(p1 < p2) swap(p1, p2);
		par[p2] = p1;
		siz[p1] += siz[p2]; 
	}
	
	ll sz(ll a){
		return siz[par[a]];
	}
};

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);	
	cin >> n;
	ll ans = 0;
	ds s;
	s.init();
	for(int i = 0; i < n; i++){
		cin >> a[i];
		if(vis[a[i]]){
			cout << ans << '\n';
			continue;
		}
		vis[a[i]] = true;
		if(vis[a[i] - 1]){
			ans -= (s.sz(a[i] - 1) + 1) / 2;
			s.merge(a[i] - 1, a[i]);
		}
		if(vis[a[i] + 1]){
			ans -= (s.sz(a[i] + 1) + 1) / 2;
			s.merge(a[i] + 1, a[i]);
		}
		ans += (s.sz(a[i]) + 1) / 2;
		cout << ans << '\n';
	}
}