#include<bits/stdc++.h>
#define N 500005
using namespace std;
int n,a[N],b[N];
int hd,st[N],rp[N];
int solve(int l,int r,int dl){
	if(l>r) return 0;
	int p=rp[l];
	if(p>r){
		b[l]=solve(l+1,r,dl+1)+1;
		return b[l];
	}
	int s=a[l]-dl-(p-l+1);
	int nl=l,nr=p,ty=0,res=0;
	if(nl+1<nr) res=max(res,solve(nl+1,nr-1,dl+2+s));
	while(1){
		int nnr=nr+(a[nr]-dl-s-((ty==0)?(nr-nl+1):(nr-l+1)));
		if(nnr==r){
			res=max(res,solve(nr+1,r,dl+1));
			break;
		}
		if(nnr==nr||a[nnr]-dl<=(nnr-nr+1)+s){
			res=max(res,solve(nr+1,nnr,dl+1+s));
			nl=nr,nr=nnr+1;s--;ty=1;
		}
		else{
			res=max(res,solve(nr+1,nnr-1,dl+2+s));
			nl=nr,nr=nnr;ty=0;
		}
	}
	b[l]=++res;
	s=a[l]-dl-(p-l+1);
	nl=l,nr=p,ty=0;
	while(1){
		b[nr]=res=res+ty;
		int nnr=nr+(a[nr]-dl-s-((ty==0)?(nr-nl+1):(nr-l+1)));
		if(nnr==r) break;
		if(nnr==nr||a[nnr]-dl<=(nnr-nr+1)+s){nl=nr,nr=nnr+1;s--;ty=1;}
		else{nl=nr,nr=nnr;ty=0;}
	}
	return res;
}
int c[N],d[N],e[N];
void run(){
	for(int i=1;i<=n;i++){
		c[i]=0;
		int mx=0;
		for(int j=i-1;j>=1;j--){
			if(max(d[i],d[j])>mx) c[i]++;
			mx=max(mx,d[j]);
		}
		mx=0;
		for(int j=i+1;j<=n;j++){
			if(max(d[i],d[j])>mx) c[i]++;
			mx=max(mx,d[j]);
		}
	}
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]),a[i]++;
	st[hd=0]=n+1;
	for(int i=n;i>=1;i--){
		while(hd>0&&a[st[hd]]<=a[i]) hd--;
		rp[i]=st[hd];
		st[++hd]=i;
	} 
	solve(1,n,0);
	for(int i=1;i<=n;i++) printf("%d ",b[i]);
	printf("\n");
}