#include "grader.h"
#include "bits/stdc++.h"
using namespace std;
void solve(int n) {
vector <int> q;
for (int i = 1; i <= n; i ++) q.push_back(i);
int cnt = query(q);
for (int i = 0; i < n; i ++) {
for (int j = 0; j < n; j ++) {
if (i == j) continue;
// for (int x = 0; x < n; x ++) cout << q[x] << ' ';
//cout << endl;
int x = q[i]; q[i] = q[j]; q[j] = x;
int c = query(q);
// for (int x = 0; x < n; x ++) cout << q[x] << ' ';
// cout << endl;
// cout << c << endl;
if (c == n) return;
if (c > cnt) {
cnt = c; continue;
}
x = q[i]; q[i] = q[j]; q[j] = x;
}
}
}
