#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
#include <omp.h>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
typedef vector<int> vi;
#define f first
#define s second
#define derr if(1) cerr

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << flush;
// END NO SAD

template<class Fun>
class y_combinator_result {
  Fun fun_;
public:
  template<class T>
  explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}

  template<class ...Args>
  decltype(auto) operator()(Args &&...args) {
    return fun_(std::ref(*this), std::forward<Args>(args)...);
  }
};

template<class Fun>
decltype(auto) y_combinator(Fun &&fun) {
  return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

template<class T>
bool updmin(T& a, T b) {
  if(b < a) {
    a = b;
    return true;
  }
  return false;
}
template<class T>
bool updmax(T& a, T b) {
  if(b > a) {
    a = b;
    return true;
  }
  return false;
}
typedef int64_t ll;

const int CONNECTED = 1;
const int DISCONNECTED = 0;
void done(int ret) {
  cout << "! " << ret << endl;
  exit(0);
}
string flip(const string& s) {
  string ret = "";
  for(auto out: s) if(out == '0') ret += "1"; else ret += "0";
  return ret;
}
string comb(const string& a, const string& b) {
  string ret = "";
  for(int i = 0; i < sz(a); i++) {
    if(a[i] == '1' || b[i] == '1') ret += "1";
    else ret += "0";
  }
  return ret;
}
void solve() {
  int n;
  cin >> n;
  map<string, int> dp;
  auto qry = [&](string s) -> int {
    if(dp.count(s)) return dp[s];
    cout << "? " << s << endl;
    int ans;
    cin >> ans;
    dp[s] = ans;
    return ans;
  };
  string init = "1";
  while(sz(init) < n) init += "0";
  for(int qq = 0; qq < n-1; qq++) {
    if(qry(init) == 0) done(DISCONNECTED);
    string cand = flip(init);
    while(true) {
      string a = "";
      string b = "";
      bool goa = true;
      int nones = 0;
      for(int i = 0; i < sz(cand); i++) {
        if(cand[i] == '0') {
          a += "0";
          b += "0";
        }
        else {
          nones++;
          assert(cand[i] == '1');
          if(goa) {
            a += "1";
            b += "0";
          }
          else {
            a += "0";
            b += "1";
          }
          goa = !goa;
        }
      }
      assert(nones > 0);
      if(nones == 1) {
        for(int i = 0; i < sz(cand); i++) {
          if(cand[i] == '1') {
            assert(init[i] == '0');
            init[i] = '1';
            break;
          }
        }
        break;
      }
      if(qry(init) + qry(a) != qry(comb(init, a))) {
        cand = a;
      }
      else {
        cand = b;
      }
    }
  }
  done(CONNECTED);
}

// what would chika do
// are there edge cases (N=1?)
// are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
// integer overflow?
// DS reset properly between test cases
// are you doing geometry in floating points
// are you not using modint when you should

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
}