#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define clr(f,n) memset(f,0,sizeof(int)*(n))
#define cpy(f,g,n) memcpy(f,g,sizeof(int)*(n))
const int N=500+5;
const ll inf=1e18;
int n,cnt=0;
ll a[N],sum[N];
struct sdf{
    ll val;int l,r;
}p[N*N];
bool cmp(sdf x,sdf y){
    return x.val<y.val;
}
bool ins(int x,int y){
    return p[x].l<=y&&y<=p[x].r;
}
int main(){
	freopen ("dhzsz.in","r",stdin);
	freopen ("dhzsz.out","w",stdout);
	scanf("%d",&n);
	for (int i=1;i<=n;i++)scanf("%lld",&a[i]),sum[i]=sum[i-1]+a[i];
	for (int i=1;i<=n;i++){
	    for (int j=i;j<=n;j++)p[++cnt]={sum[j]-sum[i-1],i,j};
    }
    sort(p+1,p+cnt+1,cmp);
    for (int i=1;i<=n;i++){
        ll ans=inf,lst=-inf;
        for (int j=1;j<=cnt;j++){
            if (ins(j,i))ans=min(ans,p[j].val-lst);
            else lst=p[j].val;
        }
        lst=inf;
        for (int j=cnt;j>=1;j--){
            if (ins(j,i))ans=min(ans,lst-p[j].val);
            else lst=p[j].val;
        }
        printf("%lld\n",ans);
    }
}