#include <bits/stdc++.h>
#include <atcoder/lazysegtree>

using namespace std;
using namespace atcoder;
using ll = long long;

using S = pair<ll, ll>;
using F = ll;
F ID = -1;
S op(S a, S b){ return {a.first + b.first, a.second + b.second}; }
S e(){ return {0, 0}; }
S mapping(F f, S x){
    if (f == ID) return x;
    else return {x.second*f, x.second};
}
F composition(F f, F g){
    if (f == ID) return g;
    else return f;
}
F id() {return ID;}

template <typename T>
void compress(vector<T> &A){

    map<T, T> comp;
    int N = A.size(), i=0;
    for (int i=0; i<N; i++) comp[A[i]];

    for (auto &e : comp){
        e.second = i;
        i++;
    }

    for (int i=0; i<N; i++) A[i] = comp[A[i]];
}

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    ll N;
    cin >> N;
    vector<ll> H(N+1), A;
    vector<S> v;
    H[0] = 1;
    for (int i=1; i<=N; i++) cin >> H[i];
    A = H;
    compress(H);
    sort(A.begin(), A.end());
    A.erase(unique(A.begin(), A.end()), A.end());
    for (int i=0; i<A.size()-1; i++){
        v.push_back({0, A[i+1]-A[i]});
    }
    v.push_back({0, 1});

    lazy_segtree<S, op, e, F, mapping, composition, id> tree(v);

    for (int i=1; i<=N; i++){
        if (i % 2 == 1) tree.apply(0, H[i]+1, 1);
        else tree.apply(0, H[i]+1, 0);
        cout << tree.all_prod().first << endl;
    }

    return 0;
}