#include<vector>
#include<map>
#include<algorithm>
#include<set>
#include<iostream>
#include<string>
#include<set>
#include<queue>

using namespace std;

#pragma GCC optimize("Ofast")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")

#define pb push_back
#define int long long
#define ld long double
#define ll long long

int32_t main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin >> n;
	vector<int> v(n);
	for (int i = 0; i < n; i++) {
		cin >> v[i];
	}
	vector<int> dp(n + 1, 1e18);
	dp[0] = 0;
	for (int i = 1; i <= n; i++) {
		int sum = 0;
		for (int j = i - 1; j >= max(0ll, i - 8); j--) {
			sum += v[j];
			dp[i] = min(dp[i], dp[j] + sum);
		}
		if (i < 10) {
			continue;
		}
		else {
			dp[i] += dp[i - 10];
			int sum = 0, mn = 1e18;
			for (int j = i - 1; j >= i - 10; j--) {
				sum += v[j];
				mn = min(mn, v[j]);
			}
			dp[i] += sum - mn;
		}
		cout << dp[i] << " ";
	}
	cout << dp[n];
	return 0;
}