#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wunused-result"
using namespace std;
template <class T>
void _R(T &x) {
  cin >> x;
}
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%" PRId64, &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U>
void R(T &head, U &...tail) {
  _R(head);
  R(tail...);
}
template <class T>
void _W(const T &x) {
  cout << x;
}
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%" PRId64, x); }
void _W(const double &x) { printf("%.16f\n", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T>
void _W(const vector<T> &x) {
  for (auto i = x.begin(); i != x.end(); _W(*i++))
    if (i != x.cbegin()) putchar(' ');
}
void W() {}
template <class T, class... U>
void W(const T &head, const U &...tail) {
  _W(head);
  putchar(sizeof...(tail) ? ' ' : '\n');
  W(tail...);
}
template <class T>
inline bool chkmax(T &a, const T &b) {
  return b > a ? a = b, true : false;
}
template <class T>
inline bool chkmin(T &a, const T &b) {
  return b < a ? a = b, true : false;
}
template <class T, class F = less<T>>
void sort_uniq(vector<T> &v, F f = F()) {
  sort(begin(v), end(v), f);
  v.resize(unique(begin(v), end(v)) - begin(v));
}
template <class T>
using MaxHeap = priority_queue<T>;
template <class T>
using MinHeap = priority_queue<T, vector<T>, greater<T>>;
const int N = 1010;
int n, a[N];
int ask() {
  printf("? ");
  for (int i = (1); i <= int(n); i++) printf("%d", a[i]);
  puts("");
  fflush(stdout);
  int x;
  scanf("%d", &x);
  return x;
}
void win(int pos0, int pos1) {
  printf("! %d %d\n", pos0, pos1);
  fflush(stdout);
}
int main() {
  scanf("%d", &n);
  int pos0 = 0, pos1 = 0;
  int base = ask();
  a[1] = 1;
  int d1 = ask();
  if (d1 < base)
    pos1 = 1;
  else
    pos0 = 1;
  int l = 2, r = n;
  while (l != r) {
    int m = (l + r) / 2;
    for (int i = (1); i <= int(n); i++) a[i] = (i <= m);
    int d2 = ask();
    bool ok = 0;
    ok |= (pos0 == 1 && d2 < d1 + (m - 1));
    ok |= (pos1 == 1 && d2 > d1 - (m - 1));
    if (ok)
      r = m;
    else
      l = m + 1;
  }
  if (pos0 == 0)
    pos0 = l;
  else
    pos1 = l;
  win(pos0, pos1);
  return 0;
}
