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

#define V vector
#define pb push_back
#define fi first
#define se second
#define all0(x) (x).begin(), (x).end()
#define all1(x) (x).begin() + 1, (x).end()

typedef long long LL;
typedef pair<int, int> pi;

mt19937 mrand(chrono::steady_clock().now().time_since_epoch().count());

int cnt = 0;
int n;
int query(V<int> v) {
    cnt++;
    assert(cnt <= 3500);
    string s(n, '0');
    for(auto x : v) s[x - 1] = '1';
    cout << "? " << s << endl;
    int t; cin >> t;
    return t;
}
struct node{
    V<int> v;
    int val;
    bool operator==(node& o) {
        return o.v == v && o.val == val;
    }
    node operator + (node& o) {
        node ans;
        ans.v = v;
        for(auto x : o.v) ans.v.pb(x);
        ans.val = query(ans.v);
        return ans;
    }
};

bool hav_edge(V<node> v) {
    LL sum = 0;
    for(auto nd : v) sum += nd.val;
    V<int> to_q;
    for(auto nd : v) for(auto x : nd.v) to_q.pb(x);
    int t = query(to_q);
    return t != sum;
}

void solve(){
    cin >> n;
    V<node> now(n);
    for(int i = 1; i <= n; i++) {
        now[i - 1].v.pb(i);
        now[i - 1].val = query({i});
    }
    while(now.size() >= 2) {
        if(!hav_edge(now)) {
            cout << "! 0" << endl;
            return;
        }
        V<node> sus = now;
        while(sus.size() >= 3) {
            int n = sus.size() + 1 >> 1;
            V<node> n_sus;
            while(1) {
                V<int> ord(sus.size());
                iota(all0(ord), 0);
                shuffle(all0(ord), mrand);
                for(int i = 0; i < n; i++) n_sus.pb(sus[ord[i]]);
                if(hav_edge(n_sus)) break;
                n_sus.clear();
            }
            sus = n_sus;
        }
        for(int i = 0; i < now.size(); i++) {
            if(now[i] == sus[0]) {
                now.erase(now.begin() + i);
                break;
            }
        }
        for(int i = 0; i < now.size(); i++) {
            if(now[i] == sus[1]) {
                now.erase(now.begin() + i);
                break;
            }
        }
        now.pb(sus[0] + sus[1]);
    }
    cout << "! 1" << endl;
}
int main() {
    // ios::sync_with_stdio(0),cin.tie(0);
    // int t; cin >> t;
    // while(t--) 
        solve();
}