#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e4;
int n;
string ans;
void init() {
  for (int i = 0; i < n; i++) ans[i] = '0';
}
void print() {
  cout << "? " << ans << '\n';
  fflush(stdout);
}
int main() {
  int pos[2] = {-1, -1};
  int i, m = 13;
  cin >> n;
  for (i = 0; i < n; i++) ans += '0';
  int s = 0, e = n - 1, x, k, t, mid;
  print();
  cin >> x;
  k = 0;
  while (m-- && s < e) {
    init();
    mid = (s + e) / 2;
    for (i = s; i <= mid; i++) ans[i] = '1';
    print();
    cin >> t;
    t -= k;
    t = (x - t + mid - s + 1) / 2;
    if (t == mid - s + 1) {
      k += t, x -= t;
      pos[1] = s;
      s = mid + 1;
    } else if (t == 0) {
      pos[0] = s;
      s = mid + 1;
    } else if (mid < e && x - t == e - mid) {
      k += x - t, x -= (x - t);
      pos[1] = e;
      e = mid;
    } else if (mid < e && x - t == 0) {
      pos[0] = e;
      e = mid;
    } else {
      k += x - t, x -= (x - t);
      e = mid;
    }
    if (pos[0] >= 0 && pos[1] >= 0) break;
  }
  if (pos[0] < 0)
    pos[0] = s;
  else if (pos[1] < 0)
    pos[1] = s;
  pos[0]++, pos[1]++;
  cout << "! " << pos[0] << " " << pos[1] << '\n';
  fflush(stdout);
}
