//#define ITERR

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <fstream>
using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using i64 = long long;

template<typename T> using vec = vector<T>;

struct Interactor
{
    vec<vec<bool>> g;
    int cnt;

    Interactor(const string &f): cnt()
    {
        ifstream iin(f);
        int n, m;
        iin >> n >> m;
        g = vec<vec<bool>>(n, vec<bool>(n));
        for (int i = 0, u, v; i < m; i++) {
            iin >> u >> v;
            --u, --v;
            g[u][v] = g[v][u] = true;
        }
    }
    
    int ask(const vec<int> &s)
    {
        if ((++cnt) > 3500) {
            cerr << "WA!" << endl;
            exit(2);
        }
        int n = g.size();
        vec<bool> vs(n), v2(n);
        for (auto i: s) vs[i - 1] = true;
        #ifdef ITERR
        cerr << "? ";
        #endif
        for (auto i: s) {
            #ifdef ITERR
            cerr << i << ' ';
            #endif
            --i;
            for (int j = 0; j < n; j++) {
                if (!vs[j] && g[i][j]) v2[j] = true;
            }
        }
        int res = 0;
        for (int i = 0; i < n; i++) {
            if (v2[i]) res++;
        }
        #ifdef ITERR
        cerr << endl << res << endl;
        #endif
        return res;
    }
    
    bool check_ans(bool ans)
    {
        int n = g.size();
        vec<int> fa(n);
        for (int i = 0; i < n; i++) fa[i] = i;
        
        auto gtf = [&](int x) { 
            while (x != fa[x]) x = (fa[x] = fa[fa[x]]);
            return x;
        };
        
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (g[i][j]) {
                    int x = gtf(i), y = gtf(j);
                    if (x != y) fa[x] = y;
                }
            }
        }
        int cnt = 0;
        for (int i = 0; i < n; i++) {
            if (gtf(i) == i) cnt++;
        }
        return ans == (cnt == 1);
    }
};

// Interactor it("a.in");

int ask(int n, const vec<int> &s)
{
    // for (auto i: s) cout << i << ' ';
    string ans(n, '0');
    for (auto i: s) ans[i - 1] = '1';
    cout << "? " << ans << endl;
    int res;
    cin >> res;
    return res;
    // return it.ask(s);
}

void ans(bool isc)
{
    if (isc) cout << "! 1" << endl;
    else {
        cout << "! 0" << endl;
    }
    // bool res = it.check_ans(isc);
    // cerr << (res ? "OK" : "WA") << endl;
    // exit(!res);
}

vec<int> mg(const vec<int> &a, const vec<int> &b)
{
    vec<int> c(a.size() + b.size());
    int tot = 0;
    for (auto i: a) c[tot++] = i;
    for (auto i: b) c[tot++] = i;
    return c;
}

signed main()
{
    int n;
    cin >> n;
    // ifstream fin("a.in");
    // int n;
    // fin >> n;
    
    vec<int> sa{1}, sb(n - 1);
    for (int i = 2; i <= n; i++) sb[i - 2] = i;
    
    int fa;
    
    while (sb.size()) {
        if ((fa = ask(n, sa)) == 0) ans(false);
        int l = 0, r = sb.size(), mid;
        while (l + 1 < r) {
            mid = (l + r) >> 1;
            vec<int> b1(sb.begin() + l, sb.begin() + mid);
            if (ask(n, b1) + fa != ask(n, mg(sa, b1))) r = mid;
            else l = mid;
        }
        sa.emplace_back(sb[l]);
        sb.erase(sb.begin() + l);
    }
    ans(true);
    return 0;
}