#include <bits/stdc++.h>
#include "doll.h"
using namespace std;
using ll = long long;
constexpr ll INF = 1000000000;
ll nxt = -2;
void connect(ll x, vector<int> &X, vector<int> &Y, ll idx) {
// cout << x << '\n';
if (X[idx] == 0) {
X[idx] = x;
}
else {
Y[idx] = x;
}
}
void distribute(ll sz, vector<int> &X, vector<int> &Y, vector<int> &A, ll idx) {
// cout << idx << ' ' << sz << ' ' << ex << endl;
if (idx >= X.size()) {
X.resize(idx + 1);
}
if (idx >= Y.size()) {
Y.resize(idx + 1);
}
// cout << sz << ' ' << e << '\n';
X[idx] = 0;
Y[idx] = 0;
if (sz == 2) {
connect(INF, X, Y, idx);
connect(INF, X, Y, idx);
return;
}
X[idx] = nxt;
nxt--;
Y[idx] = nxt;
nxt--;
distribute(sz / 2, X, Y, A, -X[idx] - 1);
distribute(sz / 2, X, Y, A, -Y[idx] - 1);
}
void create_circuit(int M, vector<int> A) {
ll NN = A.size();
A.push_back(-1);
ll N = A.size();
ll y = 0;
ll ex = 1;
while (ex < N) {
ex *= 2;
}
while (A.size() < ex) {
A.push_back(-1);
}
N = A.size();
A[N - 1] = 0;
vector<int> C, X, Y;
C.push_back(-1);
for (int i = 0; i < M; i++) {
C.push_back(-1);
}
distribute(N, X, Y, A, 0);
// for (int i = 0; i < C.size(); i++) {
// cout << C[i] << '\n';
// }
// cout << conn << '\n';
ll pos = 0, cnt = 0;
vector<bool> state(X.size());
// for (int i = 0; i < X.size(); i++) {
// cout << X[i] << ' ' << Y[i] << endl;
// }
do {
if (pos >= 0) {
pos = C[pos];
}
else {
if (state[-pos - 1] == 0) {
if (X[-pos - 1] == INF) {
X[-pos - 1] = A[cnt++];
}
state[-pos - 1] = !state[-pos - 1];
pos = X[-pos - 1];
}
else {
if (Y[-pos - 1] == INF) {
Y[-pos - 1] = A[cnt++];
}
state[-pos - 1] = !state[-pos - 1];
pos = Y[-pos - 1];
}
}
} while (pos != 0);
// for (int i = 0; i < X.size(); i++) {
// cout << '\t' << X[i] << ' ' << Y[i] << endl;
// }
if (X.size() > NN * 2) {
exit(-1);
// C[0] = 0;
}
answer(C, X, Y);
}
