#include "ancient2.h"
// #include <bits/stdc++.h>
using namespace std;
string Solve(int N) {
// return "";
string s;
for(int i = 0; i < N; i++) {
vector<int> a;
vector<int> b;
for(int j = 0; j < 1002; j++) a.push_back(j);
for(int j = 0; j < 1002; j++) b.push_back(j);
if(i < 1000) {
a[i] = 1000;
b[i] = 1001;
for(int j = 0; j < i; j++) {
a[j] = j+1;
b[j] = j+1;
}
if(Query(1002, a, b) == 1000) {
s.push_back('0');
}else {
s.push_back('1');
}
}else {
a[i] = 0;
b[i] = 1;
for(int j = 0; j < i; j++) {
a[j] = j+1;
b[j] = j+1;
}
if(Query(1002, a, b) == 0) {
s.push_back('0');
}else {
s.push_back('1');
}
}
}
return s;
}
