#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	stack<P>st;
	st.push({ INF,1 }); // 0 == green
	int ans = 0;
	rep(i, n) {
		int a; cin >> a;
		while (st.top().first < a) {
			auto top = st.top();
			st.pop();
			if (top.second)ans += top.first;
			else ans -= top.first;
		}
		if (st.top().second != i % 2) {
			if (i % 2)ans -= a;
			else ans += a;
			st.push({ a,i % 2 });
		}
		cout << ans << endl;
	}
	return 0;
}