#include <bits/stdc++.h>
#include "doll.h"
using namespace std;
typedef pair<int,int> ii;
set<int> sss;
void create_circuit(int M, std::vector<int> A) {
int n = A.size();
vector<int> C(M + 1);
//C[0] = 1;
//C[1] = -1;
//C[2] = 1;
//C[3] = 0;
//C[4] = 0;
int sw = 1000000;
int xxx = 1;
while(xxx < 1000000){
sss.insert(xxx);
xxx *= 2;
}
vector<int> X, Y;
// X.push_back(2);
//Y.push_back(3);
vector<int> target[M+1];
for(int i = 0;i < n-1;i++){
target[A[i]].push_back(A[i+1]);
}
target[A[n-1]].push_back(0);
target[0].push_back(A[0]);
map<int, ii> mm;
vector<int> t;
/*
for(int i = 0;i <= M;i++){
//printf("%d: ",i);
if(target[i].size() == 0) C[i] = 0;
else if(target[i].size() == 1) C[i] = target[i][0];
else{
t.push_back()
int nn = *sss.lower_bound(target[i].size());
int tree[2 * nn];
tree[0] = 0;
for(int j = nn;j < 2 * nn;j++){
int l = j;
int v = 0;
while(l > 1){
v *= 2;
if(l % 2 == 1) v++;
l /= 2;
}
tree[j] = v;
}
for(int j = 1;j < nn;j++){
tree[j] = sw;
sw++;
}
map<int,int> dis;
for(int j = nn;j < 2 * nn;j++){
if(j - nn < nn-target[i].size()) tree[j] = tree[1];
else dis[tree[j]] = j;
//else tree[j] = target[i][tree[j] - (nn - target[i].size())];
}
int c = 0;
for(map<int,int>::iterator it = dis.begin();it != dis.end();it++){
tree[it->second] = target[i][c];
c++;
}
//for(int j = 0;j < 2 * nn;j++){
// printf("%d ",tree[j]);
//}
for(int j = nn-1;j >= 1;j--){
if(tree[j*2] == tree[j*2+1]){
tree[j] = tree[j*2];
tree[j*2] = -1234567;
tree[j*2+1] = -1234567;
}
}
for(int j = 1;j < nn;j++){
if(tree[j*2] == -1234567) continue;
mm[tree[j]] = ii(tree[j*2],tree[j*2+1]);
}
C[i] = tree[1];
C[i] = 10000000;
}
//printf("\n");
}
*/
for(int i = 0;i <= M;i++){
if(target[i].size() == 0) C[i] = 0;
else if(target[i].size() == 1) C[i] = target[i][0];
else{
C[i] = sw;
}
}
for(int i = 0;i < n;i++){
if(C[A[i]] == sw){
if(i == n-1) t.push_back(0);
else t.push_back(A[i+1]);
}
}
/*
for(int i = 0;i < t.size();i++){
printf("%d ",t[i]);
}
printf("\n\n\n");
*/
int nn = *sss.lower_bound(t.size());
int tree[2 * nn];
tree[0] = 0;
for(int j = nn;j < 2 * nn;j++){
int l = j;
int v = 0;
while(l > 1){
v *= 2;
if(l % 2 == 1) v++;
l /= 2;
}
tree[j] = v;
}
for(int j = 1;j < nn;j++){
tree[j] = sw;
sw++;
}
map<int,int> dis;
for(int j = nn;j < 2 * nn;j++){
if(j - nn < nn-t.size()) tree[j] = tree[1];
else dis[tree[j]] = j;
//else tree[j] = t[tree[j] - (nn - t.size())];
}
int c = 0;
for(map<int,int>::iterator it = dis.begin();it != dis.end();it++){
tree[it->second] = t[c];
c++;
}
//for(int j = 0;j < 2 * nn;j++){
// printf("%d ",tree[j]);
//}
for(int j = nn-1;j >= 1;j--){
if(tree[j*2] == tree[j*2+1]){
tree[j] = tree[j*2];
tree[j*2] = -1234567;
tree[j*2+1] = -1234567;
}
}
for(int j = 1;j < nn;j++){
if(tree[j*2] == -1234567) continue;
mm[tree[j]] = ii(tree[j*2],tree[j*2+1]);
}
///
///
///
//map<int,int> dis;
dis.clear();
for(map<int,ii>::iterator it = mm.begin();it != mm.end();it++){
if(it->first >= 1000000) dis[it->first] = 0;
if(it->second.first >= 1000000) dis[it->second.first] = 0;
if(it->second.second >= 1000000) dis[it->second.second] = 0;
}
c = -1;
for(map<int,int>::iterator it = dis.begin();it != dis.end();it++){
it->second = c;
c--;
}
for(map<int,ii>::iterator it = mm.begin();it != mm.end();it++){
if(it->first < 1000000) dis[it->first] = it->first;
if(it->second.first < 1000000) dis[it->second.first] = it->second.first;
if(it->second.second < 1000000) dis[it->second.second] = it->second.second;
}
map<int,ii> mmm;
for(map<int,ii>::iterator it = mm.begin();it != mm.end();it++){
mmm[dis[it->first]] = ii(dis[it->second.first],dis[it->second.second]);
}
for(map<int,ii>::iterator it = mmm.begin();it != mmm.end();it++){
X.push_back(it->second.first);
Y.push_back(it->second.second);
}
reverse(X.begin(),X.end());
reverse(Y.begin(),Y.end());
for(int i = 0;i < C.size();i++){
if(C[i] >= 1000000) C[i] = dis[C[i]];
//printf("%d ",C[i]);
}
//printf("\n");
for(int i = 0;i < X.size();i++){
//printf("%d %d\n",X[i],Y[i]);
}
answer(C, X, Y);
}
