#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define DEBUG(...) debug(#__VA_ARGS__, __VA_ARGS__)
#else
#define DEBUG(...) 6
#endif
template<typename T, typename S> ostream& operator << (ostream &os, const pair<T, S> &p) {return os << "(" << p.first << ", " << p.second << ")";}
template<typename C, typename T = decay<decltype(*begin(declval<C>()))>, typename enable_if<!is_same<C, string>::value>::type* = nullptr>
ostream& operator << (ostream &os, const C &c) {bool f = true; os << "["; for (const auto &x : c) {if (!f) os << ", "; f = false; os << x;} return os << "]";}
template<typename T> void debug(string s, T x) {cerr << "\033[1;35m" << s << "\033[0;32m = \033[33m" << x << "\033[0m\n";}
template<typename T, typename... Args> void debug(string s, T x, Args... args) {for (int i=0, b=0; i<(int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++; else
if (s[i] == ')' || s[i] == '}') b--; else if (s[i] == ',' && b == 0) {cerr << "\033[1;35m" << s.substr(0, i) << "\033[0;32m = \033[33m" << x << "\033[31m | "; debug(s.substr(s.find_first_not_of(' ', i + 1)), args...); break;}}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> a(n);
for (int &x : a)
cin >> x;
vector<long long> edge(n);
multiset<pair<long long, int>> pq;
set<int> st;
for (int i=0; i<n; i++) {
edge[i] = a[i];
pq.emplace(a[i], i);
st.insert(i);
}
long long ret = 0;
for (int rep=0; rep<(n+1)/2; rep++) {
auto [x, i] = *pq.rbegin();
pq.erase({x, i});
ret += x;
auto it = st.erase(st.find(i));
if (it == st.begin()) {
if (it != st.end()) {
pq.erase({edge[*it], *it});
st.erase(it);
}
} else if (it == st.end()) {
pq.erase({edge[*prev(it)], *prev(it)});
st.erase(prev(it));
} else {
pq.erase({edge[*it], *it});
pq.erase({edge[*prev(it)], *prev(it)});
edge[*prev(it)] += edge[*it] - x;
pq.emplace(edge[*prev(it)], *prev(it));
st.erase(it);
}
cout << ret << "\n";
}
return 0;
}
