// Om Namah Shivaya
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
refs:
edi
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "messy.h"
int n;
void build(int l, int r){
if(l >= r) return;
string s(n,'0');
rep(i,n){
if(i >= l and i <= r){
s[i] = '0';
}
else{
s[i] = '1';
}
}
int mid = (l+r) >> 1;
for(int i = l; i <= mid; ++i){
s[i] = '1';
add_element(s);
s[i] = '0';
}
build(l,mid);
build(mid+1,r);
}
vector<int> p;
void go(int l, int r, vector<int> a){
if(l > r) return;
if(l == r){
assert(sz(a) == 1);
p[a[0]] = l;
return;
}
string s(n,'1');
trav(i,a) s[i] = '0';
int mid = (l+r) >> 1;
vector<int> v1, v2;
trav(i,a){
s[i] = '1';
if(check_element(s)){
v1.pb(i);
}
else{
v2.pb(i);
}
s[i] = '0';
}
go(l,mid,v1);
go(mid+1,r,v2);
}
vector<int> restore_permutation(int n_, int w, int r) {
n = n_;
build(0,n-1);
compile_set();
p.resize(n);
vector<int> a(n);
rep(i,n) a[i] = i;
go(0,n-1,a);
return p;
}
