#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vi = vector<int>;
using pi = pair<int, int>;
#define forn(i,n) for(int i = 0; i < n; ++i)
#define forr(i,n) for(int i = n-1; i >= 0; --i)
#define forbe(i,b,e) for(int i = b; i < e; ++i)
#define all(v) (v).begin(),(v).end()
#define sort(v) sort(all(v))
#define sz(v) ((int)(v).size())
#define endl '\n'
int publish(vi r);
void answer(vi r);
void solve (int n) {
vi r(n);
vi ans(n);
int res, lres, fst;
forn(i, n) {
forn(j, n) {
r[(n+j-i)%n] = j+1;
}
res = publish(r);
if (!i) {
fst = res;
lres = res;
continue;
}
ans[(lres-res+n-1)>>1] = i;
lres = res;
}
res = fst;
ans[(lres-res+n-1)>>1] = n;
answer(ans);
}
#ifdef ONPC
int rn;
vi rs;
vi pl;
int publish(vi r) {
int ret = 0;
forbe(i,0,rn)
cout << r[i] << ' ';
cout << endl;
forbe(i,1,rn) {
forn(j,i) {
if (pl[r[i]-1] < pl[r[j]-1])
++ret;
}
}
return ret;
}
void answer(vi r){
forbe(i,0,rn)
cout << r[i] << ' ';
forn(i, rn) {
if (rs[i] != r[i]) {
cout << "NO\n";
return;
}
}
cout << "YES\n";
}
void
rezolvare() {
cin >> rn;
rs.assign(rn,0);
pl.assign(rn,0);
forn(i,rn)
cin >> rs[i];
forn(i, rn)
pl[rs[i]-1] = i;
solve(rn);
}
int32_t
main(int argc, char** argv) {
if (argc > 1)
freopen(argv[1],"r", stdin);
rezolvare();
}
#endif
