#include<bits/stdc++.h>
using namespace std;
const long long mod=1e9+7;
long long T,a,b,c,d[1000001],v[1000001],o,h[1000001],fa[1000001],q,w,e,an,cn,fac[1000001],inv[1000001],st[1000001],u[1000001],de[1000001],idd;
char s[1000001];
struct p{long long q,w,e;}l[1000001];
long long pow_(long long qq,long long ww){long long ee=1;while(ww){if(ww&1) ee*=qq,ee%=mod;qq*=qq,qq%=mod,ww>>=1;}return ee%mod;}
inline int read(){int x=0,f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}return x*f;}
void add(long long qq,long long ww){l[++o].q=ww,l[o].w=h[qq],h[qq]=o;}
long long gcd(long long qq,long long ww){return !ww?qq:gcd(ww,qq%ww);}
long long find(long long qq){return qq==fa[qq]?qq:fa[qq]=find(fa[qq]);}
void merge(long long qq,long long ww){long long f1=find(qq),f2=find(ww);if(f1==f2) return;fa[f1]=f2;}
long long C(long long qq,long long ww){return fac[qq]*inv[ww]%mod*inv[qq-ww]%mod;}
vector<int> qu[1000001];
vector<int> ve[1000001];
void dfs(int qq,int ww)
{
	de[qq]=de[ww]+1;
	for(int i=0;i<qu[qq].size();i++)
	{
		if(qu[qq][i]!=ww) dfs(qu[qq][i],qq);
	}
}
void dfs1(int qq,int ww,int ee)
{
	if(ww!=ee)
	{
		l[++cn]=p{ee,ww,qq};
	}
	for(int i=0;i<qu[qq].size();i++)
	{
		int tt=qu[qq][i];
		if(tt!=ww)
		{
			dfs1(tt,qq,ee);
		}
	}
}
long long dp[1000001][2],mx[1000001];
int main()
{
//	freopen("1.in","r",stdin);
	srand((unsigned)(time(0)^(*new int)));
	fac[0]=1;for(int i=1;i<=1000000;i++) fac[i]=fac[i-1]*i%mod;
	inv[1000000]=pow_(fac[1000000],mod-2);for(int i=999999;i>=0;i--) inv[i]=inv[i+1]*(i+1)%mod;
	scanf("%lld",&a);
	for(int i=1;i<=a;i++)
	{
		scanf("%lld",&d[i]);
		v[d[i]]++;
	}
	for(int i=1;i<=a-2;i++)
	{
		if(d[i]==min(d[i],min(d[i+1],d[i+2]))||d[i]==max(d[i],max(d[i+1],d[i+2]))) h[d[i]]=1;
	}
	for(int i=2;i<=a-1;i++)
	{
		if(d[i]==min(d[i],min(d[i-1],d[i+1]))||d[i]==max(d[i],max(d[i-1],d[i+1]))) h[d[i]]=1;
	}
	for(int i=3;i<=a;i++)
	{
		if(d[i]==min(d[i],min(d[i-1],d[i-2]))||d[i]==max(d[i],max(d[i-1],d[i-2]))) h[d[i]]=1;
	}
	for(int i=1;i<=a;i++)
	{
		printf("%lld ",a-v[d[i]]+1-h[d[i]]);
	}
	return 0;
}