#include "doll.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
//#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;
int id = 0;
vi X,Y;
vi toggle(800005,0);
int play(int node,int l,int r) {
if (l == r) return l;
toggle[node]^=1;
int m = (l+r) >> 1;
if (toggle[node]) {
return play(2*node,l,m);
}else return play(2*node+1,m+1,r);
}
vi getorder(int n) {
toggle.assign(4*n+1,0);
vi ord;
for (int i=1;i<=n;i++) ord.push_back(play(1,1,n));
return ord;
}
void reorder(vi& v) {
int n = v.size();
if (n == 1) return;
vi nw(n);
vi ord = getorder(n);
for (int i=0;i<n;i++) nw[ord[i]-1] = v[i];
v = nw;
}
int newtree(vi v) {
int rid= id+1;
int x= v.back();
v.pop_back();
while (__builtin_popcountll(big(v)+1) != 1) v.push_back(-rid);
v.push_back(x);
reorder(v);
int s = big(v);
for (int i=1;i<=s-1;i++) {
++id;
if (2*i+1 <= s-1) {
X.push_back(-(rid+2*i-1));
Y.push_back(-(rid+2*i));
}
else {
X.push_back(v[2*i-s]);
Y.push_back(v[2*i-s+1]);
}
}
return rid;
}
void create_circuit(int M, std::vector<int> A) {
int N = A.size();
vi go[M+1];
go[0].push_back(A[0]);
for (int i=0;i<N-1;i++) go[A[i]].push_back(A[i+1]);
go[A.back()].push_back(0);
std::vector<int> C(M + 1);
for (int i = 0; i <= M; ++i) {
if (big(go[i])>1) C[i] = -newtree(go[i]);
else if (big(go[i]) == 1) C[i] = go[i][0];
else C[i] = i;
}
/* for (auto it : C) cout << it << ' ';
cout << '\n';
for (auto it : X) cout << it << ' ';
cout << '\n';
for (auto it : Y) cout << it << ' ';
cout << '\n'; */
answer(C, X, Y);
}
