#include <bits/stdc++.h>
using namespace std;
int a[205];
int N;
int query(vector<int> s) {
	for (int v : s) a[v] = 1;
	printf("? ");
	for (int i = 0; i < N; i++) printf("%d", a[i]);
	puts("");
	fflush(stdout);
	for (int v : s) a[v] = 0;
	int res;
	cin >> res;
	return res;
}
void solve(vector<vector<int>> node) {
	int n = node.size();
	if (n == 1) {
		printf("! 1");
		fflush(stdout);
		exit(0);
	}
	vector<int> g(n);
	for (int i = 0; i < n; i++) {
		g[i] = query(node[i]);
		if (g[i] == 0) {
			printf("! 0");
			fflush(stdout);
			exit(0);
		}
	}
	vector<int> A(0), vis(n), tmp(0), sum(0);
	int pre = 0;
	for (int i = 0; i < n; i++) {
		vector<int> uu = A;
		for (int u : node[i]) A.push_back(u);
		int now = query(A);
		if (now == pre + g[i]) {
			pre = now;
			vis[i] = -1;
			tmp.push_back(i);
			sum.push_back(pre);
		} else {
			vis[i] = -2;
			A = uu;
		}
	}
	for (int i = 0; i < n; i++) {
		if (vis[i] == -2) {
			int l = 0, r = tmp.size() - 1, res = tmp.size();
			auto check = [&](int m) -> bool {
				A.clear();
				for (int i = 0; i <= m; i++) {
					for (int u : node[tmp[i]]) {
						A.push_back(u);
					}
				}
				for (int u : node[i]) A.push_back(u);
				return query(A) != g[i] + sum[m];
			};
			while (l <= r) {
				int mid = (l + r) >> 1;
				if (check(mid)) res = mid, r = mid - 1;
				else l = mid + 1;
			}
			vis[i] = tmp[res];
		}
	}
	vector<vector<int>> n_node(0);
	for (int i = 0; i < n; i++) {
		if (vis[i] == -1) {
			vector<int> zz(0);
			for (int u : node[i]) zz.push_back(u);
			for (int j = 0; j < n; j++) {
				if (vis[j] == i) {
					for (int u : node[j]) zz.push_back(u);
				}
			}
			n_node.push_back(zz);
		}
	}
	solve(n_node);
}
int main() {
	int n;
	cin >> n;
	N = n;
	vector<vector<int>> node;
	node.resize(n);
	for (int i = 0; i < n; i++) {
		node[i].clear();
		node[i].push_back(i);
	}
	solve(node);
	return 0;
}