#include <bits/stdc++.h>

#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)
#define sz(a) (int)((a).size())

using namespace std;

typedef long long li;

//const int N = 205;
typedef string bs;

string operator |(const string &a, const string &b){
	string c(a.size(), '0');
	forn(i, a.size()) c[i] = max(a[i], b[i]);
	return c;
}

int n;
map<bs, int> memo;

int ask(bs cur){
	int cnt = count(cur.begin(), cur.end(), '1');
	if (cnt == 0 || cnt == n)
		return memo[cur] = 0;
	if (cnt > n - cnt || (cnt == n - cnt && cur[0] == '1')){
		forn(i, n) cur[i] ^= '0' ^ '1';
	}
	if (memo.count(cur))
		return memo[cur];
	cout << "? ";
	forn(i, n) cout << cur[i];
	cout << endl;
	int x;
	cin >> x;
	memo[cur] = x;
	return x;
}

int aske(bs a, bs b){
	return (ask(a) + ask(b) - ask(a | b)) / 2;
}

vector<bs> comp;
vector<int> rk, p;

int getp(int a){
	return a == p[a] ? a : p[a] = getp(p[a]);
}

void unite(int a, int b){
	a = getp(a), b = getp(b);
	if (a == b) return;
	if (rk[a] < rk[b]) swap(a, b);
	rk[a] += rk[b];
	p[b] = a;
	comp[a] = comp[a] | comp[b];
}

int main(){
	//cin.tie(0);
	//ios::sync_with_stdio(false);
	cin >> n;
	vector<bs> cur(n, string(n, '0'));
	forn(i, n) cur[i][i] = '1';
	while (sz(cur) > 1){		
		p.resize(sz(cur));
		iota(p.begin(), p.end(), 0);
		rk.assign(sz(cur), 1);
		comp = cur;
		
		forn(i, sz(cur)){
			auto a = cur[i];
			cur.erase(cur.begin() + i);
			
			auto collect = [&](int l, int r){
				bs tmp(n, '0');
				fore(i, l, r) tmp = tmp | cur[i];
				return tmp;
			};
			
			int l = 0, r = sz(cur);
			auto tmp = collect(l, r);
			int val = aske(a, tmp);
			if (val == 0){
				cout << "! " << 0 << endl;
				return 0;
			}
			while (l < r - 1){
				int m = (l + r) / 2;
				auto nw = collect(l, m);
				if (aske(a, nw) == 0)
					l = m;
				else
					r = m;
			}
			unite(i, l < i ? l : (l + 1));
			cur.insert(cur.begin() + i, a);
		}
		
		cur.clear();
		forn(i, sz(comp)) if (getp(i) == i)
			cur.push_back(comp[i]);
	}
	
	cout << "! " << 1 << endl;
}