#include <bits/stdc++.h>
using namespace std;
int n;
int h;
bool found(int x, int l, int mid) {
  string s(n, '0');
  for (int i = l; i <= mid; i++) s[i]++;
  cout << "? " << s << endl;
  int d;
  cin >> d;
  if (x == 1)
    return d != h + mid - l + 1;
  else
    return d != h - (mid - l + 1);
}
int main() {
  cin >> n;
  string s(n, '0');
  cout << "? " << s << endl;
  int d1;
  cin >> d1;
  h = d1;
  s[0] = '1';
  cout << "? " << s << endl;
  int d2;
  cin >> d2;
  int pos0 = -1, pos1 = -1;
  if (d1 < d2)
    pos0 = 0;
  else
    pos1 = 0;
  int x;
  if (pos0 == -1)
    x = 0;
  else
    x = 1;
  int l = 0, r = n - 1;
  while (l < r) {
    int mid = (l + r) / 2;
    if (found(x, l, mid))
      r = mid;
    else
      l = mid + 1;
  }
  if (pos0 == -1)
    pos0 = l;
  else
    pos1 = l;
  cout << "! " << pos0 + 1 << " " << pos1 + 1 << endl;
  return 0;
}
