// Bolatulu
#include <bits/stdc++.h>
#include "art.h"
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
*/
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
#define pb push_back
#define eb emplace_back
#define ins insert
#define F first
#define S second
#define md (tl+tr)/2
#define TL v+v,tl,md
#define TR v+v+1,md+1,tr
#define Tl t[v].l,tl,md
#define Tr t[v].r,md+1,tr
#define all(x) (x).begin(),(x).end()
#define yes cout << "YES\n"
#define no cout << "NO\n"
// #define int long long
#define file(s) freopen(s".in", "r", stdin); freopen(s".out", "w", stdout);
#define ld long double
using namespace std;
int binpow(int a,int n,int M) {
if (n==0)
return 1;
if (n%2!=0)
return (a * binpow(a,n-1,M))%M;
int z=binpow(a,n/2,M);
return (z*z)%M;
}
const ll INF = 1e18+7;
const int N = 1e5+7;
const int M = 1e4+7;
const ld eps = 1e-3;
int n,a[N];
vector <int> ans;
int check(int i,bool b) {
// cout << i << ' ' << b << endl;
vector <int> d;
if (!b)
d.pb(i+1);
for (int j=1;j<=n;j++) {
if (j!=i+1) {
// cout << j << ' ';
d.pb(j);
}
}
// cout << endl;
if (b)
d.pb(i+1);
return publish(d);
}
void solve(int nn) {
n=nn;
int s=check(0,0);
vector <pair <int,int>> d;
for (int i=0;i<n;i++) {
int z,y,l=0;
if (i>0) {
z=s-check(i,false);
y=i;
l+=(y-z)/2;
}
d.eb(l+1,i);
}
sort(all(d));
reverse(all(d));
for (int i=0;i<n;i++)
ans.pb(d[i].S);
answer(ans);
}
/*
signed main() {
//file("jenga");
ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
int test = 1;
// cin >> test;
while (test--) {
solve();
if (test)
cout << '\n';
}
return 0;
}
*/
