// author : thembululquaUwU
// 3.9.2024
#include <bits/stdc++.h>
#include "art.h"
#define pb push_back
#define fi first
#define se second
#define endl '\n'
using namespace std;
using ll = long long;
using ii = pair <int, int>;
using vi = vector <int>;
const int MaxN = 2e5;
const int mod = 1e9 + 7;
void solve(int n){
vector <int> rt(n);
for (int i = 0; i < n; ++ i){
vector <int> ask(n);
for (int j = 0; j < n; ++ j) ask[j] = (i + j) % n + 1;
rt[i] = publish(ask);
}
vector <int> ord(n);
iota(ord.begin(), ord.end(), 0);
sort(ord.begin(), ord.end(), [&](int u, int v){
return rt[u] - rt[(u + 1) % n] < rt[v] - rt[(v + 1) % n];
});
for (int &f : ord) f ++;
answer(ord);
}
//int main(){
// if (fopen("pqh.inp", "r")){
// freopen("pqh.inp", "r", stdin);
// freopen("pqh.out", "w", stdout);
// }
// ios_base::sync_with_stdio(0);
// cin.tie(0); cout.tie(0);
//
// int t = 1; // cin >> t;
// while (t --) solve();
// return 0;
//}
