#include<bits/stdc++.h>
using namespace std;
int a[10001];
long long dp[10001];
int n;
int main()
{
	cin >> n;
	for (int i = 1; i <= n; i++)cin >> a[i];
	dp[1] = a[1];//初始化边界条件
	for (int i = 2; i <= n; i++)
	{
		for (int j = 1; j < i; j++)
		{		
			if (a[j] <= a[i])
			{
				dp[i] = max(dp[i], dp[j] + a[i]);
			}
		}
	}
	for (int i = 1; i <= n; i++)
		cout << dp[i] << " ";
	return 0;
}