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

using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using ii = pair<int, int>;
using vii = vector<ii>;

#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(x) x.begin(), x.end()
#define pb(x) push_back(x)

int ask(set<int> st, int n) {
    string s(n, '0');
    for (auto x : st)
        s[x] = '1';
    cout << "? " << s << endl;
    int res; cin >> res;
    return res;
}

set<int> OR(set<int> &a, set<int> &b) {
    set<int> st = a;
    for (auto x : b)    
        st.insert(x);
    return st;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n; cin >> n;
    set<int> A, B;
    A.insert(0);
    rep(i, 1, n)
        B.insert(i);
    int fA = ask(A, n);
    rep(i, 0, n - 1) {
        if (!fA) return cout << "! 0" << endl, 0;
        set<int> cur = B;

        while (cur.size() > 1) {
            set<int> L;
            while (L.size() < cur.size()) {
                L.insert(*cur.begin());
                cur.erase(cur.begin());
            }

            int fB = ask(L, n), fAB = fA + ask(OR(A, L), n);
            if (!fB) return cout << "! 0" << endl, 0; 
            if (fA + fB != fAB)
                cur = L;
        }

        if (cur.empty() || fA + ask(cur, n) == fA + ask(OR(A, cur), n)) cout << "! 0" << endl, 0; 

        A.insert(*cur.begin());
        B.erase(*cur.begin());
        fA = ask(A, n);
    }

    cout << "! 1" << endl;
}