#ifndef hwe
#include "art.h"
#endif
#include <bits/stdc++.h>
using namespace std;
#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))
#define Int __int128
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;
template <class T1, class T2> bool maximize(T1 &x, T2 y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T> void remove_duplicate(vector<T> &ve) {
sort (ve.begin(), ve.end());
ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
long long random(long long l, long long r) {
return uniform_int_distribution<long long>(l, r)(rng);
}
template <class T> T random(T r) {
return rng() % r;
}
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;
#ifdef hwe
int n;
vector<int> A;
int publish(vector<int> R) {
vector<int> pos(n + 1);
for (int i = 0; i < A.size(); ++i) pos[A[i]] = i;
int ans = 0;
for (int i = 0; i < R.size(); ++i) for (int j = i + 1; j < R.size(); ++j) {
if (pos[R[i]] > pos[R[j]]) ++ans;
}
return ans;
}
void answer(vector<int> R) {
cerr << "answer ";
for (auto &x : R) cerr << x << ' ';
cerr << '\n';
}
#endif
void solve(int n) {
vector<int> p(n); iota(p.begin(), p.end(), 1);
vector<int> inv(n), ans(n);
for (int i = 0; i < n; ++i) {
inv[i] = publish(p);
rotate(p.begin(), p.begin() + 1, p.end());
// cerr << inv[i] << ' ';
}
// cerr << '\n';
// for (auto &x : p) cerr << x << ' ';
// cerr << '\n';
for (int i = 0; i < n; ++i) {
int nxt = (i == n - 1 ? 0 : i + 1);
int idx = (n - 1 - (inv[nxt] - inv[i])) / 2;
ans[idx] = p[i];
}
answer(ans);
}
#ifdef hwe
signed main() {
cin >> n;
A.assign(n, 0);
for (auto &x : A) cin >> x;
solve(n);
return 0;
}
#endif
