#include <bits/stdc++.h>
using namespace std;
int n;
int qcount = 0;
int ask(int l, int r) {
  qcount++;
  printf("? ");
  for (int i = 0; i < n; i++) printf("%c", (i >= l and i <= r) ? '1' : '0');
  printf("\n");
  fflush(stdout);
  if (qcount > 15) exit(0);
  int ret;
  scanf("%d", &ret);
  return ret;
}
int main() {
  scanf("%d", &n);
  int h0 = ask(0, -1);
  int lo = 0, hi = n - 1;
  while (hi - lo > 1) {
    int mid = (lo + hi) / 2;
    int a = ask(lo, mid);
    int sz = mid - lo + 1;
    if (a != h0 - sz and a != h0 + sz)
      hi = mid;
    else
      lo = mid;
  }
  int pos0 = lo, pos1 = hi;
  if (ask(hi, hi) > h0) swap(pos0, pos1);
  printf("! %d %d\n", pos0 + 1, pos1 + 1);
  fflush(stdout);
  return 0;
}
