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

int main(){
  int n; cin >> n; vector<int> A(n); for (int& a:A) cin >> a;
  stack<pair<int,int>> s; int res = 0; s.emplace(1,(int)1e9);
  for (int i(0);i < n;++i){
    while(!s.empty()&&s.top().second<=A[i]){
      auto [a,b] = s.top(); s.pop();
      res += (a?1:-1)*b;
    }
    if (s.empty()||s.top().first!=i%2) s.emplace(i%2,A[i]),res += (i%2?-1:1)*A[i];
    cout << res << endl;
  }
}