#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using ii = pair<int,int>;
using vii = vector<ii>;
using vi = vector<ll>;
ll gcd(ll a, ll b) {return a == 0? b: gcd(b%a,a);}
ll lcm(ll a, ll b) {return a * (b / gcd(a,b));}
#define pb push_back
#define FOR(i,a,b)  for(int i = (a); i < (b); i++)
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define lb(v,a) lower_bound(v.begin(),v.end(),a)-v.begin()
#define ub(v,a) upper_bound(v.begin(),v.end(),a)-v.begin()-1
    
    bool check(vi& num, ll x){
        ll n = num.size();
        FOR(i,0,n){
            ll idxf = (i + 1) % n, idxs = (i + 2) % n;
            ll fir = num[i], sec = num[idxf], ter = num[idxs];
            if (x == min({fir, sec, ter}) || x == max({fir, sec, ter})) {
                return true;
            }
        }
    return false;
    }


    int main(){
        ios::sync_with_stdio(0);
        cin.tie(0);
        ll n; cin >> n;
        vi num(n);
        map<ll,ll> mp;
        FOR(i,0,n) {cin >> num[i]; mp[num[i]]++;}
        vi ans(n);
        FOR(i,0,n){
            if(check(num,num[i])) ans[i] = n-mp[num[i]];
            else ans[i] = n-mp[num[i]]+1;
        }
        for(auto x : ans) cout << x << " "; cout << endl;
    }