#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;
#include "messy.h"
int ans[1024];
bool ask(int n, vector<int> v, int i)
{
string s(n, '1');
Loop (j,0,v.size())
if (j != i)
s[v[j]] = '0';
return check_element(s);
}
void solve(int n, vector<int> vec, int bit)
{
assert((vec.size()<<bit) == n);
if (vec.size() == 1)
return;
vector<int> v[2];
for (int x : vec) {
int tmp = ask(n, vec, x);
v[tmp].push_back(x);
ans[x] ^= tmp << bit;
}
solve(n, v[0], bit+1);
solve(n, v[1], bit+1);
}
void make(int n, int msk, int p2bit)
{
string s;
Loop (i,0,n) {
if (i%p2bit != msk)
s.push_back('1');
else
s.push_back('0');
}
Loop (i,0,n) {
if (i%p2bit == msk && (i&p2bit)) {
s[i] = '1';
add_element(s);
s[i] = '0';
}
}
}
std::vector<int> restore_permutation(int n, int w, int r)
{
for (int p2bit = 1; p2bit < n; p2bit *= 2) {
Loop (msk,0,p2bit)
make(n, msk, p2bit);
}
compile_set();
vector<int> kooft(n);
iota(kooft.begin(), kooft.end(), 0);
solve(n, kooft, 0);
return vector<int>(ans, ans+n);
}
