#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 1e5 + 114;
int n;
int a[N];
vector <int> v[N];
int ans[N];

int to(int x) { return a[(x - 1) % n + 1]; }

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for(int i = 1; i <= n; i = i + 1)
    {
        cin >> a[i];
        v[a[i]].push_back(i);
    }
    for(int i = 1; i <= n; i = i + 1)
    {
        int res = n - v[a[i]].size();
        bool flag = 1;
        for(auto j : v[a[i]])
        {
            if(flag == 0)
                break;
            if(max(max(to(j), to(j + 1)), to(j + 2)) == to(j) || min(min(to(j), to(j + 1)), to(j + 2)) == to(j))
                flag = 0;
            if(max(max(to(j - 1), to(j)), to(j + 1)) == to(j) || min(min(to(j - 1), to(j)), to(j + 1)) == to(j))
                flag = 0;
            if(max(max(to(j - 2), to(j - 1)), to(j)) == to(j) || min(min(to(j - 2), to(j - 1)), to(j)) == to(j))
                flag = 0;
        }
        cout << res + flag << " ";
    }
    cout << "\n";
    return 0;
}