#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 2305843009213693951
#define REP(i,n) for(ll i=0;i<(n);i++)

ll N;
ll remQ = 3500;

void input(void){
    cin >> N;
}

void output(int c){
    cout << "! " << c << endl;
    exit(0);
}

map<vector<ll>,ll> memo;

ll query(vector<ll> C){

    if((ll)C.size() == N){
        return 0;
    }

    if(memo.find(C)!=memo.end()){
        return memo[C];
    }

    assert(remQ > 0);

    string S(N,'0');
    for(ll c:C){
        S[c] = '1';
    }
    cout << "? " << S << endl;
    remQ--;
    ll c;
    cin >> c;

    memo[C] = c;
    return c;
}



int main(void){
    
    input();

    vector<pair<vector<ll>,ll>> C(N);
    REP(i,N){
        C[i] = {{i},query({i})};
    }

    // C の [l,r) に連結なところはあるか
    function<ll(ll,ll)> ask = [&](ll l, ll r){
        assert(0<=l && l<r && r<=(ll)C.size());

        vector<ll> E;
        ll sum = 0;
        for(ll x=l;x<r;x++){
            for(ll e:C[x].first){
                E.push_back(e);
            }
            sum += C[x].second;
        }
        ll q = query(E);
        if(q < sum){ // 連結あり
            return 1;
        }

        // 孤立
        return 0;

    };

    while(1){

        // cerr << "$$$ " << endl;
        // REP(i,(ll)C.size()){
        //     REP(j,(ll)C[i].first.size()){
        //         cerr << C[i].first[j] << " ";
        //     }
        //     cerr << "  " << C[i].second << endl;
        // }cerr << endl;

        if(C.size()==1){
            output(1);
        }

        ll l = 0, r = C.size();
        if(ask(l,r)==0){
            output(0);
        }

        while(abs(r-l)>2){

            ll m = (l+r)/2;
            if(ask(l,m)==1){
                r = m;
            }else{
                l = m;
            }

        }

        // l と l+1 が連結
        pair<vector<ll>,ll> s;
        s.first = C[l].first;
        for(ll e:C[l+1].first){
            s.first.push_back(e);
        }
        s.second = ask(l,l+1);
        for(ll x=l;x+2<(ll)C.size();x++){
            C[x] = C[x+2];
        }
        C.pop_back();
        C.pop_back();
        C.push_back(s);

    }

    return 0;
    
}