#include <bits/stdc++.h>
using namespace std;
int n;
int pos0 = -1, pos1 = -1;
void ask(string s) { cout << "? " << s << endl; }
void solve(int l, int r, int cnt0, int cnt1, int dist) {
  if (cnt0 == 0) pos1 = l;
  if (cnt1 == 0) pos0 = l;
  if (pos0 != -1 && pos1 != -1) {
    printf("! %d %d", pos0 + 1, pos1 + 1);
    exit(0);
  }
  if (cnt0 == 0 || cnt1 == 0) return;
  int mid = l + (r - l) / 2;
  string tmp;
  for (int i = 0; i <= mid; ++i) {
    tmp.push_back('1');
  }
  for (int i = mid + 1; i <= r; ++i) {
    tmp.push_back('0');
  }
  for (int i = r + 1; i < n; ++i) {
    tmp.push_back('1');
  }
  int l0, l1, r0, r1, diff, len = mid - l + 1;
  ask(tmp);
  cin >> diff;
  l0 = (len - dist + diff) / 2;
  l1 = mid - l + 1 - l0;
  r0 = cnt0 - l0;
  r1 = cnt1 - l1;
  solve(l, mid, l0, l1, dist - r1 + r0);
  solve(mid + 1, r, r0, r1, dist - l1 + l0);
}
int main() {
  cin >> n;
  string foo;
  for (int i = 0; i < n; ++i) {
    foo.push_back('0');
  }
  ask(foo);
  int cnt1;
  cin >> cnt1;
  solve(0, n - 1, n - cnt1, cnt1, cnt1);
  return 0;
}
