#include <bits/stdc++.h>
using namespace std;

mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
long long random(long long l, long long r){
   return uniform_int_distribution<long long>(l,r)(rng);
}

int main() {
    int n; cin >> n;
    int st = random(0, n-1);
    vector<int> curr(1, st);
    vector<int> lft;
    for(int i = 1; i < n; i++) {
        if(st == i) continue;
        lft.push_back(i);
    }

    vector<int> gr(n, 0);
    string zeros = string(n, '0');

    for(int i = 0; i < n; i++) {
        zeros[i] = '1';
        cout << "? " << zeros << endl;
        cin >> gr[i];
        zeros[i] = '0';
    }

    bool cmp = true;
    for(int i = 0; i < n-1; i++) {
        bool found = false;
        shuffle(lft.begin(), lft.end(), rng);

        string msk = string(n, '0');
        for(int x : curr) msk[x] = '1';

        for(int j = 0; j < (int) lft.size(); j++) {
            int x = lft[j];
            msk[x] = '1';

            cout << "? " << msk << endl;
            int res; cin >> res;
            if(res < gr[0] + gr[x]) {
                found = true;
                gr[0] = res;
                curr.push_back(x);
                lft.erase(lft.begin() + j);
                break;
            }
            msk[x] = '0';
        }

        if(!found) {
            cmp = false;
            break;
        }
    }

    cout << "! " << cmp << endl;
	
    return 0;
}