#include <bits/stdc++.h>

#define ll long long

int n;
int f(std::vector<int> a){
    std::string s(n, '0');
    for (auto x : a){
        s[x - 1] = '1';
    }
    std::cout << "? " << s << '\n';
    int x;
    std::cin >> x;
    return x;
}

int main() {

    std::cin >> n;

    std::vector<int> A,B;
    int y = f({1});

    if (y == 0){
        std::cout << "! " << 0 << '\n';
        return 0;
    }
    for (int i = 2; i <= n; i++){
        B.push_back(i);
    }
    A.push_back(1);
    for (int i = 1; i < n; i++){
        int Fa = f(A);
        int Fb = f(B);
        std::vector<int> tmp1 = A;
        tmp1.insert(tmp1.end(), B.begin(), B.end());
        if (Fa + Fb == f(tmp1)){
            std::cout << "! " << 0 << '\n';
            return 0;
        }
        auto dfs = [&](auto &&self, int l, int r)->void{
            if (l == r){
                A.push_back(B[l]);
                B.erase(B.begin() + l);
            }else{
                int mid = l + r >> 1;
                std::vector<int> tmp = A;
                tmp.insert(tmp.end(), B.begin() + l, B.begin() + mid + 1);
                if (Fa + f(std::vector<int>(B.begin() + l, B.begin() + mid + 1)) != f(tmp)){
                    self(self, l, mid);
                }else{
                    self(self, mid + 1, r);
                }
            }
        };
        dfs(dfs, 0, B.size() - 1);
    }

    std::cout << "! 1\n";

    return 0;
}