#include<iostream>
#include<cstdio>
#include<map> 
#include<vector>
#define fopen(x, y) freopen(x".in", "r", stdin); freopen(y".out", "w", stdout);
#define int long long
#ifdef int
#define inf 0x3f3f3f3f3f3f3f3fll
#else
#define inf 0x3f3f3f3f
#endif

using namespace std;

int n, a[100005], ans[100005], v[100005], lst[100005], nxt[100005], cnt;

vector<int> g[100005];

inline int chk(int i) {
	return v[i] && (v[lst[i]] == -v[i] && v[nxt[i]] == -v[i]);
}

void modify(int i, int x) {
	cnt -= chk(lst[i]) + chk(i) + chk(nxt[i]);
	v[i] = x;
	cnt += chk(lst[i]) + chk(i) + chk(nxt[i]);
}

void work() {
	cin >> n;
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
		lst[i] = i % n + 1;
		nxt[lst[i]] = i;
		v[i] = 1;
		g[a[i]].push_back(i);
	}
	for(int i = 1; i <= 100000; i++) {
		for(int x : g[i]) modify(x, 0);
		for(int x : g[i - 1]) modify(x, -1);
		if(g[i].size()) {
			ans[i] = n - g[i].size() + cnt;
		}
	}
	for(int i = 1; i <= n; i++) {
		cout << ans[a[i]] << ' '; 
	}cout << '\n';
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(0);
	int _ = 1;
//	cin >> _;
	while(_--) work();
}