#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(1e9 + 7)
using namespace std;
template<class T1, class T2>
bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}
template<class T1, class T2>
bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}
template<class T1, class T2>
void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}
template<class T1, class T2>
void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}
template<class T>
void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
const int MAX = 2e5 + 10;
int N;
ll a[MAX];
int nxt[MAX], prv[MAX], isDel[MAX];
priority_queue<pair<ll, int>> pq;
void solve(){
cin >> N;
for(int i = 1; i <= N; i++){
cin >> a[i];
pq.push({a[i], i});
nxt[i] = i + 1;
prv[i] = i - 1;
}
a[0] = a[N + 1] = -oo;
ll cur = 0;
for(int i = 1; i <= (N + 1) / 2; i++){
while(isDel[pq.top().se]) pq.pop();
int x = pq.top().se; pq.pop();
cur += a[x];
a[x] = a[prv[x]] + a[nxt[x]] - a[x];
pq.push({a[x], x});
isDel[prv[x]] = isDel[nxt[x]] = true;
nxt[x] = nxt[nxt[x]];
prv[x] = prv[prv[x]];
nxt[prv[x]] = x;
prv[nxt[x]] = x;
cout << cur << '\n';
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("numtable.inp","r",stdin);
// freopen("numtable.out","w",stdout);
solve();
return 0;
}
