// #define LOCAL
#include <bits/stdc++.h>
#define fir first
#define sec second
#define el '\n'

#ifdef LOCAL
#define FINISH cerr << "FINISH" << endl;
#else
#define FINISH ;
#endif

#ifdef LOCAL
#define debug(x) cerr << setw(4) << #x << " == " << x << endl
#else
#define debug(x)
#endif

#ifdef LOCAL
#define debugv(x)                   \
    cerr << setw(4) << #x << ":: "; \
    for (auto i : x)                \
        cerr << i << " ";           \
    cerr << endl
#else
#define debugv(x)
#endif

using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
ostream& operator<<(ostream& out, PII& x)
{
    out << x.fir << " " << x.sec << endl;
    return out;
}

const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const int N = 220;
int n, ans, totq = 0;
vector<vector<int>> edge(N);
int vis[N];
void input() {
	cin >> n;
#ifdef LOCAL
	int m;
	cin >> m;
	vector<int> f(n + 1, 0);
	for (int i = 1; i <= n; i++) {
		f[i] = i;
	}
	function<int(int)> find = [&](int x) {
		if (f[x] == x)
			return x;
		return f[x] = find(f[x]);
	};
	for (int i = 1; i <= m; i++) {
		int x, y;
		cin >> x >> y;
		edge[x].push_back(y);
		edge[y].push_back(x);
		x = find(x);
		y = find(y);
		if (x != y)
			f[x] = y;
	}
	int flag = 0;
	for (int i = 1; i <= n; i++) {
		if (f[i] == i)
			flag++;
	}
	if (flag == 1)
		ans = 1;
	else 
		ans = 0;
	cout << "! " << ans << endl;
#endif
}

int query(string s) {
	totq++;
	if (totq >= 3500) {
		cout << "OUT OF LIMIT!!!" << endl;
		assert(false);
	}
	int sum = 0;
#ifdef LOCAL
	cout << "? " << s << endl;
	vector<int> v(n + 1, 0);
	for (int i = 1;  i <= n; i++) {
		if (s[i - 1] == '1')
			v[i] = 1;
	}
	for (int i = 1; i <= n; i++) {
		if (v[i])
			continue;
		int flag = 0;
		for (auto to : edge[i]) {
			if (v[to])
				flag = 1;
		}
		sum += flag;
	}
	cout << "rep : " << sum << endl;
#else
	cout << "? " << s << endl;
	cin >> sum;
#endif
	return sum;
}

bool check (int l, int r, int tot, vector<int> &state) {
	// cout <<"check " << l <<" " <<r <<" " << tot << endl;
	string s2 = "";
	string s12 = "";
	for (int i = 1; i <= n; i++) {
		if (vis[i] == 1) {
			s12.push_back('1');
			s2.push_back('0');
		}
		else {
			s12.push_back('0');
			s2.push_back('0');
		}
	}

	for (int i = 0; i < r; i++) {
		s2[state[i] - 1] = '1';
		s12[state[i] - 1] = '1';
	}

	int x2 = query(s2);
	int x12 = query(s12);

	if (tot + x2 == x12)
		return false;
	return true;
}

void printans (int x) {
	cout << "! "  << x << endl;
#ifdef LOCAL
	if (x == ans) {
		cout << "ACCEPT" << endl;
	}
	else {
		cout << "WRONG ANSWER" << endl;
	}
#endif
}

void solve()
{
    input();
    vis[1] = 1;
    for (int i = 2; i <= n; i++) {
    	int l = 1, r = 0;
    	string s1 = "";
    	vector<int> state;
		for (int j = 1; j <= n; j++) {
			if (vis[j] == 1)
				s1.push_back('1');
			else {
				r++;
				state.push_back(j);
				s1.push_back('0');
			}
		}
		// cout << "s1: " << endl << s1 << endl;

		// debugv(state);
    	int tot = query(s1);
    	if (tot == 0) {
    		printans(0);
    		return;
    	}
    	while (l < r) {
    		// cout << l << " " << r << endl;
    		int mid = (l + r) >> 1;
    		if (check(i, mid, tot, state))
    			r = mid;
    		else
    			l = mid + 1;
    	}
    	vis[state[l - 1]] = 1;
    	// cout << "add  " << state[l - 1] <<endl;
    }
    printans(1);
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}