/*
IN THE NAME OF GOD
*/
#include <bits/stdc++.h>
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;
#define F first
#define S second
#define Mp make_pair
#define pb push_back
#define pf push_front
#define size(x) ((ll)x.size())
#define all(x) (x).begin(),(x).end()
#define kill(x) cout << x << '\n', exit(0);
#define fuck(x) cout << "(" << #x << " , " << x << ")" << endl
#define endl '\n'
const int N = 1e6+23, lg = 18;
ll Mod = 1e9+7; //998244353;
inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
ll ans = 1;
a=MOD(a, mod);
while (b) {
if (b & 1) ans = MOD(ans*a, mod);
b >>= 1;
a = MOD(a*a, mod);
}
return ans;
}
ll n, a[N], ans;
set<pll> st, rst;
int main () {
ios_base::sync_with_stdio(false), cin.tie(0);
cin>>n;
for(int i=1; i<=n; i++) {
cin>>a[i];
st.insert({a[i], i});
rst.insert({i, a[i]});
}
while(size(st) > 0) {
auto tmp = st.end(); tmp--;
pll it = (*tmp);
ans += (it.F);
cout<<ans<<endl;
if(size(st) == 1) break;
if(it.S == (rst.rbegin()->F)) {
st.erase(it);
rst.erase({it.S, it.F});
it = (*rst.rbegin());
st.erase({it.S, it.F});
rst.erase(it);
continue;
} else if (it.S == (rst.begin()->F)) {
st.erase(it);
rst.erase({it.S, it.F});
it = (*rst.begin());
st.erase({it.S, it.F});
rst.erase(it);
continue;
}
auto tmp2 = rst.upper_bound({it.S, it.F});
auto nxt2 = (*tmp2); tmp2--; tmp2--;
auto prev2 = (*tmp2);
ll sztmp = size(rst);
rst.erase(nxt2);
rst.erase(prev2);
rst.erase({it.S, it.F});
st.erase(it);
st.erase({nxt2.S, nxt2.F});
st.erase({prev2.S, prev2.F});
st.insert({nxt2.S+prev2.S-it.F, it.S});
rst.insert({it.S, nxt2.S+prev2.S-it.F});
}
return 0;
}
