#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e6+5,M=N*4+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n;
int qry(vector<int> S){
	string c(n,'0');
	for(int i:S) c[i-1]='1';
	cout<<"? "<<c<<endl;
	fflush(stdout);
	int x;cin>>x;
	return x;
}
int vis[N],fa[N];
int GF(int x){return fa[x]^x?fa[x]=GF(fa[x]):x;}
vector<int> S[N];int deg[N];
vector<int> st;
void ask(int id,vector<int> V){
	vector<int> G;
	G.push_back(id);
	for(int i:V) for(int j:S[i]) G.push_back(j);
	int sum=deg[id];
	for(int i:V) sum+=deg[i];
	if(qry(G)==sum) return;
	if(V.size()==1){
		st.push_back(V[0]);
		return;
	}
	int m=V.size()/2;
	ask(id,{V.begin(),V.begin()+m});
	ask(id,{V.begin()+m,V.end()});
}
void Solve(){
	cin>>n;
	for(int i=1;i<=n;i++){
		deg[i]=qry({i});
		vector<int> V;
		for(int j=1;j<=n;j++) if(!S[j].empty()) V.push_back(j);
		st.clear();
		ask(i,V);
		S[i].push_back(i);
		for(int j:st){
			for(int h:S[j]) S[i].push_back(h);
			S[j].clear();
		}
		deg[i]=qry(S[i]);
	}
	for(int i=1;i<n;i++) if(!S[i].empty()){
		cout<<"! 0"<<endl;
		fflush(stdout);
		return;
	}
	cout<<"! 1"<<endl;
	fflush(stdout);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}