#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int C = 26;
void add(int &x, int y) {
  x += y;
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
}
int fix(int x) {
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
  return x;
}
int pw(int a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = 1ll * ret * a % MOD;
    b >>= 1;
    a = 1ll * a * a % MOD;
  }
  return ret;
}
const int MAXN = 1e6 + 10;
int Q = 0;
int ask(string s) {
  Q++;
  assert(Q < 15);
  cout << "? " << s << endl;
  int x;
  cin >> x;
  return x;
}
void solve() {
  int n;
  cin >> n;
  int zeros = ask(string(n, '1'));
  int ones = n - zeros;
  if (ones > zeros) {
    int a = -1, b = -1;
    while (b == -1) {
      string s(n, '0');
      int i = rand() % n;
      s[i] = '1';
      if (ask(s) < ones) {
        b = i;
      } else {
        a = i;
      }
    }
    if (a == -1) {
      int lo = 0, hi = n - 1;
      while (lo < hi) {
        int m = (lo + hi + 1) / 2;
        string s(n, '1');
        for (int i = n - 1, j = m; j; i--, j--) {
          s[i] = '0';
        }
        if (ask(s) == zeros + m) {
          lo = m;
        } else {
          hi = m - 1;
        }
      }
      a = n - lo - 1;
    }
    cout << "! " << a + 1 << " " << b + 1 << endl;
  } else {
    int a = -1, b = -1;
    while (a == -1) {
      string s(n, '1');
      int i = rand() % n;
      s[i] = '0';
      if (ask(s) < zeros) {
        a = i;
      } else {
        b = i;
      }
    }
    if (b == -1) {
      int lo = 0, hi = n - 1;
      while (lo < hi) {
        int m = (lo + hi + 1) / 2;
        string s(n, '0');
        for (int i = n - 1, j = m; j; i--, j--) {
          s[i] = '1';
        }
        if (ask(s) == ones + m) {
          lo = m;
        } else {
          hi = m - 1;
        }
      }
      b = n - lo - 1;
    }
    cout << "! " << a + 1 << " " << b + 1 << endl;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  srand(time(NULL));
  int te = 1;
  for (int w = 1; w <= te; w++) {
    solve();
  }
  return 0;
}
