#include<iostream>
#include<cstdio>
#include<vector>
#define fopen(x, y) freopen(x".in", "r", stdin); freopen(y".out", "w", stdout);
//#define int long long
#ifdef int
#define inf 0x3f3f3f3f3f3f3f3fll
#else
#define inf 0x3f3f3f3f
#endif

using namespace std;

int n; 

typedef pair<string, int> node;

vector<node> g;
string s;

int query(string s) {
	cout << "?" + s << '\n';
	fflush(stdout);
	int res; cin >> res; return res;
}

string bor(string s, string t) {
	for(int i = 1; i <= n; i++) s[i] |= t[i];
	return s;
}

string bor(vector<node> g) {
	string res = " ";
	for(int i = 1; i <= n; i++) res += '0';
	for(node nd : g) {
		for(int i = 1; i <= n; i++) {
			res[i] |= nd.first[i];
		} 
	}
	return res;
}

pair<vector<node>, vector<node> > split(vector<node> g) {
	vector<node> f1, f2;
	for(int i = 0; i < g.size(); i++) {
		if(i & 1) f1.push_back(g[i]);
		else f2.push_back(g[i]);
	}
	return {f1, f2};
}

void merge(vector<node> &a, vector<node> b) {
	for(node nd : b) a.push_back(nd);
}

void solve(vector<node> &g) {
	node nd = g[0]; g.erase(g.begin());
	vector<node> f = g; g.clear();
	if(nd.second == 0) {
		cout << "! 0\n";
		fflush(stdout);
		exit(0);
	}
	while(f.size() > 1) {
		pair<vector<node>, vector<node> > f1 = split(f);
		string t = bor(f1.first);
		if(nd.second + query(t) != query(bor(nd.first, t))) f = f1.first, merge(g, f1.second);
		else f = f1.second, merge(g, f1.first);
//		cout << "#" << ' ' << f.size() << endl; 
	}
	nd.first = bor(nd.first, f[0].first); nd.second = query(nd.first);
	g.push_back(nd);
}

void work() {
	cin >> n;
	for(int i = 1; i <= n; i++) {
		s = " ";
		for(int j = 1; j <= n; j++) {
			s += (char)(48 + (i == j));
		}
		g.push_back({s, query(s)});
	}
	while(g.size() > 1) solve(g);
	cout << "! 1\n"; fflush(stdout);
}

signed main() {
	int _ = 1;
//	cin >> _;
	while(_--) work();
}