#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
#define vc vector
using namespace std;
template<class T> using vv = vc<vc<T>>;
template<class T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>; using LP = pair<ll,ll>;
int geti(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<class T1,class T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<class T1,class T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<class T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<class T>string join(const T&v,const string&d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<class T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<class T>void vin(vc<T>&a){int n;cin>>n;a=vc<T>(n);cin>>a;}
template<class T>void vin(vv<T>&a){int n,m;cin>>n>>m;a=vv<T>(n,vc<T>(m));cin>>a;}
template<class T1,class T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<class T1,class T2>void operator++(pair<T1,T2>&a,int){a.fi++;a.se++;}
template<class T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<class T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<class T1,class T2>void operator+=(vc<T1>&a,T2 b){for(T1&x:a)x+=b;}
template<class T1,class T2>void operator-=(vc<T1>&a,T2 b){for(T1&x:a)x-=b;}
template<class T1,class T2>void operator*=(vc<T1>&a,T2 b){for(T1&x:a)x*=b;}
template<class T1,class T2>void operator/=(vc<T1>&a,T2 b){for(T1&x:a)x/=b;}
template<class T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<class T1,class T2>pair<T1,T2>operator+(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi+b.fi,a.se+b.se};}
template<class T1,class T2>pair<T1,T2>operator-(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi-b.fi,a.se-b.se};}
template<class T>pair<T,T>operator*(const pair<T,T>&a,T b){return {a.fi*b,a.se*b};}
template<class T1,class T2>bool mins(T1& x,const T2&y){if(y<x){x=y;return true;}else return false;}
template<class T1,class T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<class T>T min(const vc<T>&a){return *min_element(rng(a));}
template<class T>T max(const vc<T>&a){return *max_element(rng(a));}
template<class Tx,class Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<class T>ll suma(const vc<T>&a){ll s=0;for(auto&&x:a)s+=x;return s;}
template<class T>ll suma(const vv<T>&a){ll s=0;for(auto&&x:a)s+=suma(x);return s;}
template<class T>void uni(T&a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<class T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("Yes"); return;}
#define no { puts("No"); return;}
#define yn {puts("Yes");}else{puts("No");}
random_device _rd;
struct xrand {
  static const uint64_t _x = 88172645463325252ull;
  uint64_t x;
  xrand(): x(_x ^ (_rd()+time(0))) {}
  xrand(uint64_t seed): x(_x ^ seed) {}
  uint64_t get() {
    x = x ^ (x << 7);
    return x = x ^ (x >> 9);
  }
  ull operator()() { return get();}
  ull operator()(ull n) { return get()%n;}
  ll operator()(ll l, ll r) { return get()%(r-l+1) + l;}
} rnd;
template<typename T> void shuffle(vc<T>& a) {
  for (int i = a.size(); i >= 2; --i) swap(a[i-1],a[rnd(i)]);
}

#define rtn(x) { fans(x); return;} // flush!


struct Solver {
  void solve() {
    int n;
    cin>>n;

    int rem = 3500;
    map<string,int> mem;
    auto f = [&](const vi& a) {
      string s(n,'0');
      for (int i : a) s[i] = '1';
      if (mem.count(s)) return mem[s];
      rem--;
      cout<<"? "<<s<<endl;
      int r; cin>>r;
      return mem[s] = r;
    };

    auto fans = [&](int ans) {
      if (ans == -1) ans = rnd(2);
      cout<<"! "<<ans<<endl;
    };

    if (n == 1) rtn(1);

    // vi deg(n);
    // rep(i,n) deg[i] = f(vi(1,i));
    // rep(i,n) if (deg[i] == 0) rtn(0);
    // if (suma(deg) < n-1) rtn(0);

    vi vs; int now = 0;
    // {
    //   vi cand; int mx = -1;
    //   rep(i,n) {
    //     if (mx > deg[i]) continue;
    //     if (mx < deg[i]) mx = deg[i], cand = vi();
    //     cand.pb(i);
    //   }
    //   vs.pb(cand[rnd(sz(cand))]);
    //   now = deg[vs[0]];
    // }

    vs.pb(rnd(n)); now = f(vs);

    set<int> us;
    rep(i,n) us.insert(i);
    us.erase(vs[0]);

    while (rem && sz(us)) {
      vi ws;
      for (int i : us) ws.pb(i);
      shuffle(ws);
      auto g = [&](vi a) {
        int base = f(a);
        a += vs;
        return base+now != f(a);
      };
      if (!g(ws)) rtn(0);

      auto dfs = [&](auto dfs, vi ws) {
        if (sz(ws) == 1) {
          vs.pb(ws[0]);
          now = f(vs);
          us.erase(ws[0]);
          return;
        }
        int c = sz(ws)/2;
        vi ls(ws.begin(),ws.begin()+c);
        vi rs(ws.begin()+c,ws.end());
        if (g(ls)) dfs(dfs,ls);
        if (g(rs)) dfs(dfs,rs);
      };
      dfs(dfs,ws);

      // for (int u : ws) {
      //   vs.pb(u);
      //   int res = f(vs);
      //   if (res == deg[u]+now) {
      //     vs.pob();
      //   } else {
      //     now = res;
      //     us.erase(u);
      //   }
      //   if (sz(us) == 0) rtn(1);
      //   if (now == 0) rtn(0);
      //   // if (rem == 0) rtn(1);
      //   if (rem == 0) assert(false);
      // }
    }
    fans(1);
  }
};

int main() {
  // cin.tie(nullptr); ios::sync_with_stdio(false);
  int ts = 1;
  // scanf("%d",&ts);
  rep1(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}