#include <iostream>
#include <cstring>

using namespace std;

int dp[11][11];
int ksei[11];
int n;

int rek(int shinka,int kakusei){
    if(ksei[shinka]<kakusei)
    return -2;
    if(shinka==0)
    return kakusei+1;
    if(dp[shinka][kakusei]==-1){
        int r=99999999;
        int a=rek(shinka-1,kakusei),b;
        if(a!=-2)
        r=min(r,a+1);
        for(int ctr1=0;ctr1<kakusei;ctr1++){
            a=rek(shinka,ctr1);
            b=rek(shinka,kakusei-1-ctr1);
            if(a!=-2 && b!=-2)
            r=min(r,a+b);
        }
        dp[shinka][kakusei]=r;
    }
    //cout<<shinka<<" "<<kakusei<<" "<<dp[shinka][kakusei]<<endl;
    return dp[shinka][kakusei];
}

int main()
{
    memset(dp,-1,sizeof(dp));
    cin>>n;
    for(int ctr1=0;ctr1<=n;ctr1++)
    cin>>ksei[ctr1];
    for(int ctr1=0;ctr1<ksei[n];ctr1++){
        cout<<rek(n,ctr1)<<" ";
    }
    cout<<rek(n,ksei[n])<<endl;
    return 0;
}