#include <bits/stdc++.h>
using namespace std;
bool IOerror = 0;
inline char nc() {
  static char buf[100000], *p1 = buf + 100000, *pend = buf + 100000;
  if (p1 == pend) {
    p1 = buf;
    pend = buf + fread(buf, 1, 100000, stdin);
    if (pend == p1) {
      IOerror = 1;
      return -1;
    }
  }
  return *p1++;
}
inline bool blank(char ch) {
  return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
}
inline void read(int &x) {
  char ch;
  while (blank(ch = nc()))
    ;
  if (IOerror) return;
  for (x = ch - '0'; (ch = nc()) >= '0' && ch <= '9';
       x = (x << 1) + (x << 3) + ch - '0')
    ;
}
const int N = 1010;
char S[N];
int n, pos0, pos1;
void clear() {
  for (int i = (0); i <= (n - 1); i++) S[i] = '0';
  S[n] = '\0';
}
int qs() {
  int tmp;
  cout << "? " << S << endl;
  fflush(stdout);
  cin >> tmp;
  return tmp;
}
int main() {
  int cnt0, cnt1;
  cin >> n;
  clear();
  cnt0 = qs();
  S[0] = '1';
  cnt1 = qs();
  if (cnt0 == cnt1 + 1)
    pos1 = 1;
  else
    pos0 = 1;
  if (pos1 == 0) {
    int l = 2, r = n;
    while (l < r) {
      int mid = (l + r) >> 1;
      clear();
      for (int i = (l); i <= (mid); i++) S[i - 1] = '1';
      cnt1 = qs();
      int tmp = mid - l + 1 - cnt1 + cnt0;
      if (tmp > 0)
        r = mid;
      else
        l = mid + 1;
    }
    pos1 = l;
  } else {
    int l = 2, r = n;
    while (l < r) {
      int mid = (l + r) >> 1;
      clear();
      for (int i = (l); i <= (mid); i++) S[i - 1] = '1';
      cnt1 = qs();
      int tmp = mid - l + 1 - (mid - l + 1 - cnt1 + cnt0) / 2;
      if (tmp > 0)
        r = mid;
      else
        l = mid + 1;
    }
    pos0 = l;
  }
  cout << "! " << pos0 << ' ' << pos1 << endl;
  return 0;
}
