#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    ll N;cin>>N;
    vl A(N),S(MAX),F(MAX);
    for(int i=0;i<N;i++){
        cin>>A[i];
        S[A[i]]++;
    }
    for(int i=0;i<N;i++){
        ll x=A[i];
        ll ans=N-S[x];
        ll a=A[(i+N-1)%N],b=A[(i+1)%N];
        if(a<x&&x<b) ans++;
        else if(b<x&&x<a) ans++;
        else F[x]=true;
    }
    for(int i=0;i<N;i++){
        ll x=A[i];
        ll ans=N-S[x];
        if(!F[x]) ans++;
        cout<<ans<<" ";
    }
    cout<<endl;
}