#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;

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;
}

/*string operator !(const string &a){
	string c(a.size(), '0');
	forn(i, a.size()) c[i] = a[i] ^ '0' ^ '1';
	return c;
}*/

int n;
map<bs, int> memo;

int queries;
mt19937 rnd(51);

int ask(bs cur){
	int cnt = count(cur.begin(), cur.end(), '1');
	if (memo.count(cur))
		return memo[cur];
	if (cnt == 0 || cnt == n)
		return memo[cur] = 0;
	++queries;
	if (queries == 3499){
		cout << "! " << rnd() % 2 << endl;
		exit(0);
	}
	cout << "? ";
	forn(i, n) cout << cur[i];
	cout << endl;
	int x;
	cin >> x;
	return memo[cur] = x;
}

int ask2(bs a, bs b){
	return ask(a) + ask(b) != ask(a | b);
}

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;
	comp.assign(n, string(n, '0'));
	forn(i, n) comp[i][i] = '1';
	forn(i, n) if (ask(comp[i]) == 0){
		cout << "! " << 0 << endl;
		return 0;
	}
	rk.assign(n, 1);
	p.resize(n);
	iota(p.begin(), p.end(), 0);
	vector<int> ord(n);
	iota(ord.begin(), ord.end(), 0);
	while (sz(ord) > 1){
		shuffle(ord.begin(), ord.end(), rnd);
		bool ok = false;
		fore(i, 1, sz(ord)) if (ask2(comp[getp(ord[0])], comp[getp(ord[i])])){
			unite(ord[0], ord[i]);
			ok = true;
			break;
		}
		if (!ok){
			cout << "! " << 0 << endl;
			return 0;
		}
		vector<int> nord;
		forn(i, sz(ord)) if (ord[i] == getp(ord[i]))
			nord.push_back(ord[i]);
		ord = nord;
	}
	cout << "! " << 1 << endl;
}