#include <bits/stdc++.h>
#define inf (0x7f7f7f7f)
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
typedef long long ll;
using namespace std;
template <class T>
inline void read(T &x){
    int ch = 0, f = 0; x = 0;
    for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = 1;
    for(; isdigit(ch); ch = getchar()) x = x * 10 + ch - 48;
    if(f) x = -x;
} 
namespace I{
    int n, trials = 0;
    vector<vector<int> > g;
    const bool is_local = false;
    inline void init(int _n, vector<vector<int> > _g){
        n = _n;
        if(is_local){
            g = _g;
            if(!(int) g.size()){
                g.resize(n + 1);
                for(int i = 1; i < n / 2; i++){
                    int x = i;
                    int y = i + 1;
                    g[x].push_back(y);
                    g[y].push_back(x);
                }
                
                for(int i = n / 2 + 1; i < n; i++){
                    int x = i;
                    int y = i + 1;
                    g[x].push_back(y);
                    g[y].push_back(x);
                }

                g[n/2+1].push_back(n);
                g[n].push_back(n/2+1);

            }
        }
    }
    inline int query(vector<int> s){
        assert((int) s.size() == n);
        assert(++trials <= 3500);
        printf("? ");
        for(auto x : s) printf("%d", x);
        puts("");
        if(is_local){
            set<int> st;
            for(int i = 0; i < (int) s.size(); i++) if(s[i])
                for(auto v : g[i + 1]) st.insert(v);
            int res = (int) st.size();
            for(int i = 0; i < (int) s.size(); i++) if(s[i])
                res -= (st.find(i + 1) != st.end());
            return res;
        }
        else{

            fflush(stdout);
            int res = 0;
            scanf("%d", &res);
            return res;
        }
    }
    inline void submit(int ans){
        printf("! %d\n", ans);
        if(is_local){
            vector<int> fa(n + 1);
            for(int i = 1; i <= n; i++) fa[i] = i;
            auto ask = [&](auto &ask, int x) -> int {
                return x == fa[x] ? x : fa[x] = ask(ask, fa[x]);
            };
            for(int i = 1; i <= n; i++)
                for(auto v : g[i]){
                    int p = ask(ask, i), q = ask(ask, v);
                    if(p != q) fa[p] = q;
                }
            int cnt = 0;
            for(int i = 1; i <= n; i++)
                if(ask(ask, i) == i) cnt++;
            int real_ans = (cnt == 1);
            assert(ans == real_ans);
        }
        else fflush(stdout);
    }
}

int main(){
    srand(time(NULL));
    int n;
    scanf("%d", &n);
    I::init(n, vector<vector<int> > {});
    if(n == 1) return I::submit(1), 0;

    vector<int> fa(n + 1), deg(n + 1);
    for(int i = 1; i <= n; i++) fa[i] = i;
    
    auto ask = [&](auto &ask, int x) -> int {
        return x == fa[x] ? x : fa[x] = ask(ask, fa[x]);
    };

    int sum_of_deg = 0;

    for(int i = 1; i <= n; i++){
        vector<int> s(n);
        s[i-1] = 1;
        deg[i] = I::query(s);
        sum_of_deg += deg[i];
    }

    int sz = n;
    auto is_disconnected = [&]() -> int {
        if(sum_of_deg < 2 * sz - 2) return 1;
        for(int i = 1; i <= n; i++)
            if(ask(ask, i) == i && deg[i] == 0)
                return 1;
        return 0;
    };

    auto doit = [&](vector<int> vec) -> pair<bool, int> {
        vector<int> s(n);
        int cur_deg = 0;
        for(auto x : vec){
            cur_deg += deg[x];
            for(int i = 1; i <= n; i++)
                if(ask(ask, i) == x) s[i-1] = 1;
        }
        int res = I::query(s);
        // cout << res << " " << cur_deg << endl;
        if(res == cur_deg) return {false, res};
        return {true, res};
    };

    while(sz > 1){
        if(is_disconnected()) return I::submit(0), 0;
        vector<int> vec;
        for(int i = 1; i <= n; i++) if(ask(ask, i) == i) vec.push_back(i);
        random_shuffle(vec.begin(), vec.end());
        // cout << "size: " << sz << endl;
        int flag = 0;

        for(int l = 1; l < (int) vec.size(); l += 3){
            int r = min((int) vec.size() - 1, l + 2);
            vector<int> tmp = {vec[0]};
            for(int i = l; i <= r; i++) tmp.push_back(vec[i]);
            if(!doit(tmp).first) continue;
            for(int i = 0; i + 1 < (int) tmp.size(); i++){
                for(int j = i + 1; j < (int) tmp.size(); j++){
                    vector<int> qry = {tmp[i], tmp[j]};
                    auto [vct, res] = doit(qry);
                    // cout << "!" << vct << " " << res << endl;
                    if(!vct) continue;
                    fa[tmp[i]] = tmp[j];
                    deg[tmp[j]] = res;
                    sz--;
                    flag = 1;
                    break;
                }
                if(flag) break;
            }
            break;
        }

        assert(flag);
    }

    I::submit(1);

    return 0;
}