#include<bits/stdc++.h>
#include "art.h"
//#include "sample_grader.cpp"
using namespace std;
#define endl '\n'
#define ll long long
vector <int> dx = {1, 0, 0, -1, 0, 0};
vector <int> dy = {0, 1, 0, 0, -1, 0};
vector <int> dz = {0, 0, 1, 0, 0, -1};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
const ll MAX = 2005, MOD = 1e9 + 7, INF = 1e18;
void solve(int n)
{
vector <int> vec(n);
for (int i = 0; i < n; i++)
{
vec[i] = i + 1;
}
int compbef = publish(vec);
if (compbef == 0)
{
answer(vec);
}
int j = n - 1;
while (j > 0)
{
for (int i = j; i > 0; i--)
{
swap(vec[i], vec[i - 1]);
int compaft = publish(vec);
if (compaft == 0)
{
answer(vec);
}
if (compaft > compbef)
{
swap(vec[i], vec[i - 1]);
j = i - 1;
break;
}
compbef = compaft;
}
}
compbef = publish(vec);
if (compbef == 0)
{
answer(vec);
}
j = n - 1;
while (j > 0)
{
for (int i = j; i > 0; i--)
{
swap(vec[i], vec[i - 1]);
int compaft = publish(vec);
if (compaft == 0)
{
answer(vec);
}
if (compaft > compbef)
{
swap(vec[i], vec[i - 1]);
j = i - 1;
break;
}
compbef = compaft;
}
}
}
