#include <bits/stdc++.h>
using namespace std;
long long solve() {
  long long n, x, y, z, pos1 = -1, pos0 = -1, f = 0;
  cin >> n;
  long long l = 0, r = n - 1;
  cout << "? ";
  fflush(stdout);
  for (long long i = 0; i < n; i++) {
    cout << "1";
    fflush(stdout);
  }
  cout << endl;
  fflush(stdout);
  cin >> x;
  cout << "? ";
  fflush(stdout);
  for (long long i = 0; i < n - 1; i++) {
    cout << "1";
    fflush(stdout);
  }
  cout << "0" << endl;
  fflush(stdout);
  cin >> z;
  if (z > x) {
    pos1 = n;
    while (l < r) {
      long long m = (l + r) / 2;
      cout << "? ";
      fflush(stdout);
      for (long long i = 0; i < l; i++) {
        cout << "1";
        fflush(stdout);
      }
      for (long long i = l; i < m + 1; i++) {
        cout << "0";
        fflush(stdout);
      }
      for (long long i = m + 1; i < n; i++) {
        cout << "1";
        fflush(stdout);
      }
      cout << endl;
      fflush(stdout);
      cin >> y;
      if (y == m + 1 + x - l)
        l = m + 1;
      else
        r = m;
      if (l == r) break;
    }
    pos0 = l + 1;
  } else {
    pos0 = n;
    cout << "? ";
    fflush(stdout);
    for (long long i = 0; i < n; i++) {
      cout << "0";
      fflush(stdout);
    }
    cout << endl;
    fflush(stdout);
    cin >> x;
    l = 0;
    r = n - 1;
    while (l < r) {
      long long m = (l + r) / 2;
      cout << "? ";
      fflush(stdout);
      for (long long i = 0; i < l; i++) {
        cout << "0";
        fflush(stdout);
      }
      for (long long i = l; i < m + 1; i++) {
        cout << "1";
        fflush(stdout);
      }
      for (long long i = m + 1; i < n; i++) {
        cout << "0";
        fflush(stdout);
      }
      cout << endl;
      fflush(stdout);
      cin >> y;
      if (y == m + 1 + x - l)
        l = m + 1;
      else
        r = m;
      if (l == r) break;
    }
    pos1 = l + 1;
  }
  cout << "! " << pos0 << " " << pos1;
  fflush(stdout);
  return 0;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  long long t = 1;
  while (t--) {
    solve();
    cout << "\n";
  }
  return 0;
}
