#include <bits/stdc++.h>
using namespace std;
int n;
char s[10000];
int main() {
  cin.tie(NULL);
  cout.tie(NULL);
  scanf("%d", &n);
  int cnt, now;
  for (int i = 0; i < n; i++) s[i] = '0';
  printf("? %s\n", s);
  fflush(stdout);
  scanf("%d", &cnt);
  s[0] = '1';
  printf("? %s\n", s);
  fflush(stdout);
  scanf("%d", &now);
  if (now < cnt) {
    int pos1 = 1;
    cnt = now;
    int l = 2;
    int r = n;
    while (l < r) {
      int m = (l + r) >> 1;
      if ((m - l) % 2) m--;
      for (int i = l; i <= m; i++) s[i - 1] = '1';
      printf("? %s\n", s);
      fflush(stdout);
      scanf("%d", &now);
      if (now != cnt - (m - l + 1)) {
        for (int i = l; i <= m; i++) s[i - 1] = '0';
        r = m;
      } else {
        cnt = now;
        l = m + 1;
      }
    }
    printf("! %d %d", l, pos1);
    fflush(stdout);
  } else {
    s[0] = '0';
    int pos0 = 1;
    int l = 2;
    int r = n;
    while (l < r) {
      int m = (l + r) >> 1;
      if ((m - l) % 2) m--;
      for (int i = l; i <= m; i++) s[i - 1] = '1';
      printf("? %s\n", s);
      fflush(stdout);
      scanf("%d", &now);
      if (now != cnt + (m - l + 1)) {
        for (int i = l; i <= m; i++) s[i - 1] = '0';
        r = m;
      } else {
        cnt = now;
        l = m + 1;
      }
    }
    printf("! %d %d", pos0, l);
    fflush(stdout);
  }
}
