from sys import stdin
input=stdin.readline

def solv():
 N=int(input())
 D=list(map(int, input().split()))
 if N==1:
  print(0)
  return

 s=[0]*N
 s[0]=0
 s[N-1]=N-1

 S=[0]
 for i in range(1,N-1):
  if D[i]-D[i-1]<=D[i+1]-D[i]:
   while S[-1]>0 and D[S[-1]]-D[S[-1]-1]<=D[i+1]-D[S[-1]]:
    S.pop()
   s[i]=S[-1]
  S.append(i)
 S=[N-1]
 for i in range(N-2,0,-1):
  if D[i+1]-D[i]<D[i]-D[i-1]:
   while S[-1]<N-1 and D[S[-1]+1]-D[S[-1]]<D[S[-1]]-D[i-1]:
    S.pop()
   s[i]=S[-1]
  S.append(i)

 def find(i):
  if s[i]==i:
   return i
  else:
   s[i]=find(s[i])
   return s[i]

 for i in range(N):
  print(N-1-find(i),end=' ')
 return

solv()