#include <bits/stdc++.h>
using namespace std;
const int N=110;
int top=0,top2=0,n;
//入栈是++top,出栈是top--
int stk[N],stk_min[N];
int a[N],s[N];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
s[i]=s[i-1]+a[i];
}
for(int i=1;i<=n;i++)
{
stk[++top]=s[i];
if(s[i]<stk_min[top2])
{
stk[++top2]=s[i];
}
cout<<stk[top2]<<" ";
}
return 0;
}