#include <bits/stdc++.h>
using namespace std;
int n;
int pos0 = -1, pos1 = -1;
int cnt = 1;
void solve(int hamming, int l, int r) {
  if (l > r || (pos0 != -1 && pos1 != -1)) return;
  printf("? ");
  string s = string(n, '0');
  int mid = (l + r) / 2;
  for (int i = l; i <= mid; i++) s[i] = '1';
  cout << s << endl;
  fflush(stdout);
  cnt++;
  int changed = mid - l + 1;
  int newHamming;
  scanf("%d", &newHamming);
  int expectedHamming = hamming - changed;
  if (newHamming == expectedHamming) {
    pos1 = l;
    solve(hamming, mid + 1, r);
  } else if (newHamming == hamming + changed) {
    pos0 = l;
    solve(hamming, mid + 1, r);
  } else {
    solve(hamming, l, mid);
  }
}
int main() {
  scanf("%d", &n);
  printf("? ");
  string s = "";
  for (int i = 0; i < n; i++) printf("0");
  printf("\n");
  fflush(stdout);
  int o;
  scanf("%d", &o);
  solve(o, 0, n - 1);
  printf("! %d %d", pos0 + 1, pos1 + 1);
  fflush(stdout);
  return 0;
}
