#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int const N = 100 * 1000 + 16;
int const M = 1000 * 1000 * 1000 + 7;
int ask(string const& s) {
  cout << "? " << s << "\n" << flush;
  int ret;
  cin >> ret;
  return ret;
}
void answer(int x, int y) {
  cout << "! " << x << " " << y << "\n" << flush;
  exit(0);
}
int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  int n;
  cin >> n;
  string s(n, '0');
  int ones = ask(s);
  int zeros = n - ones;
  s[0] = '1';
  bool is_one = ask(s) < ones;
  if (is_one) {
    int l = 1;
    int r = n - 1;
    int best = 1;
    while (l <= r) {
      int m = l + r >> 1;
      string s = string(m, '0') + string(n - m, '1');
      int v = ask(s);
      if (zeros + m == v)
        l = m + 1, best = m;
      else
        r = m - 1;
    }
    answer(best + 1, best);
  } else {
    int l = 1;
    int r = n - 1;
    int best = 1;
    while (l <= r) {
      int m = l + r >> 1;
      string s = string(m, '1') + string(n - m, '0');
      int v = ask(s);
      if (ones + m == v)
        l = m + 1, best = m;
      else
        r = m - 1;
    }
    answer(best, best + 1);
  }
}
