#include <iostream>
using namespace std;
int n, a[5005];
int query(int s, int t);
void answer(int i, int x);
int find1Pos() {
int l = 1, r = n;
while (r - l > 1) {
int mid = (r + l) / 2;
if (query(mid, n) == n - 1) l = mid;
else r = mid - 1;
}
if (query(r, n) == n - 1) return r;
return l;
}
int getVal(int cur, int p, int pp) {
int d = query(min(cur, p), max(cur, p));
if (a[p] + d > n) {
return a[p] - d;
} else if (a[p] - d < 1) {
return a[p] + d;
} else {
/*int e = query(min(cur, pp), max(cur, pp));
int c = 1;
if (a[p] > a[pp]) c = -1;
return (e == abs(a[p] - a[pp]) ? a[p] + (c * d) : a[p] - (c * d));*/
int y = query(min(cur, pp), max(cur, pp));
if (a[p] > a[pp]) {
return (y == a[p] - a[pp] + d ? a[p] + d : a[p] - d);
/*if (y == a[p] - a[pp] + d) {
return a[p] + d;
} else {
return a[p] - d;
}*/
} else {
return (y == a[pp] - a[p] + d ? a[p] - d : a[p] + d);
/*if (y == a[pp] - a[p] + d) {
return a[p] - d;
} else {
return a[p] + d;
}*/
}
}
}
void solve(int N) {
n = N;
int k = find1Pos();
a[k] = 1;
for (int i = k - 1; i >= 1; i--) {
a[i] = getVal(i, i + 1, i + 2);
}
for (int i = k + 1; i <= n; i++) {
a[i] = getVal(i, i - 1, i - 2);
}
for (int i = 1; i <= n; i++) {
answer(i, a[i]);
}
}
