#include <bits/stdc++.h>
using namespace std;
int n;
int now[1005];
int lst;
void query() {
  printf("? ");
  for (int i = 1; i <= n; i++) printf("%d", now[i]);
  puts("");
  fflush(stdout);
}
int x;
int main() {
  scanf("%d", &n);
  query();
  scanf("%d", &lst);
  now[1] = 1;
  query();
  scanf("%d", &x);
  int ans1, ans2;
  if (x < lst) {
    ans2 = 1;
    lst = x;
    int l = 1, r = n;
    while (l <= r) {
      int mid = (l + r) >> 1;
      for (int i = 1; i <= mid; i++) {
        now[i] = 1;
      }
      for (int i = mid + 1; i <= n; i++) {
        now[i] = 0;
      }
      query();
      scanf("%d", &x);
      if (lst - x == mid - 1) {
        ans1 = mid + 1;
        l = mid + 1;
      } else {
        r = mid - 1;
      }
    }
  } else {
    ans1 = 1;
    for (int i = 1; i <= n; i++) {
      now[i] = 1;
    }
    now[1] = 0;
    query();
    scanf("%d", &lst);
    int l = 1, r = n;
    while (l <= r) {
      int mid = (l + r) >> 1;
      for (int i = 1; i <= mid; i++) {
        now[i] = 0;
      }
      for (int i = mid + 1; i <= n; i++) {
        now[i] = 1;
      }
      query();
      scanf("%d", &x);
      if (lst - x == mid - 1) {
        ans2 = mid + 1;
        l = mid + 1;
      } else {
        r = mid - 1;
      }
    }
  }
  printf("! %d %d", ans1, ans2);
  fflush(stdout);
  return 0;
}
