#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include "bits_stdc++.h"
#include <stdio.h>
#include <algorithm>
#include <memory.h>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
using namespace std;
//using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
ll const INF = 1e13;
int main()
{
ll n, a;
input(n);
multiset<pi> s1, s2;
s1.insert(mp(-INF, 0)); s1.insert(mp(-INF, n+1));
s2.insert(mp(0, -INF)); s2.insert(mp(n+1, -INF));
for (ll i=1; i<=n; ++i)
{
input(a);
s1.insert(mp(a, i));
s2.insert(mp(i, a));
}
ll ans = 0;
for (ll i=0; i<(n+1)/2; ++i)
{
ans+=s1.rbegin()->f;
print(ans, '\n');
ll ind = s1.rbegin()->s;
auto it = s2.lb(mp(ind, -INF));
it--;
ll neww = 0;
s1.erase(s1.lb(mp(it->s, it->f)));
neww += it->s;
it = s2.erase(it);
s1.erase(s1.lb(mp(it->s, it->f)));
neww-=it->s;
it = s2.erase(it);
s1.erase(s1.lb(mp(it->s, it->f)));
neww+=it->s;
s2.erase(it);
s1.insert(mp(neww, ind));
s2.insert(mp(ind, neww));
}
return 0;
}