#include<bits/stdc++.h> #include"ancient2.h" using namespace std; using ll=int; string Solve(int n){ string sol; sol.resize(n); vector<ll>b; for(int i=0;i<n+1;++i) b.push_back(1+i); b.push_back(n+1); for(int i=0;i<n;++i){ vector<ll>a; for(int j=0;j<i;++j) a.push_back(1+j); a.push_back(n+1); for(int j=i+1;j<n+1;++j) a.push_back(1+j); a.push_back(n+1); assert(a.size()==n+2&&b.size()==n+2); sol[i]='0'+(Query(n+2,b,a)==n+1); } return sol; }