#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T BM(T p, T e, T M) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T mdINV(T a, T M) {
  return BM(a, M - 2, M);
}
template <class T>
inline T PW(T p, T e) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p);
    p = (p * p);
  }
  return (T)ret;
}
template <class T>
string NTS(T Number) {
  stringstream ss;
  ss << Number;
  return ss.str();
}
template <class T>
T stringtonumber(const string &Text) {
  istringstream ss(Text);
  T result;
  return ss >> result ? result : 0;
}
template <class T>
bool ISLEFT(T a, T b, T c) {
  if (((a.first.first - b.first.first) * (b.second.second - c.second.second) -
       (b.first.first - c.first.first) * (a.second.second - b.second.second)) <
      0.0)
    return 1;
  else
    return 0;
}
int main() {
  int n;
  scanf("%d", &n);
  cout << "? ";
  for (int i = 1; i <= n; i++) cout << 1;
  cout << "\n";
  int first;
  cin >> first;
  cout << "? ";
  cout << 0;
  for (int i = 1; i < n; i++) cout << 1;
  cout << "\n";
  int second;
  cin >> second;
  if (first > second) {
    int lop;
    int lo = 2;
    int hi = n;
    while (lo <= hi) {
      int mid = (lo + hi) / 2;
      cout << "? ";
      for (int i = 1; i <= mid; i++) cout << 0;
      for (int j = mid + 1; j <= n; j++) cout << 1;
      cout << "\n";
      int ho;
      cin >> ho;
      if (second - ho == mid - 1) {
        lo = mid + 1;
      } else {
        hi = mid - 1;
        lop = mid;
      }
    }
    cout << "! " << 1 << " " << lop << endl;
  } else {
    cout << "? " << 1;
    for (int i = 2; i <= n; i++) cout << 0;
    cout << "\n";
    cin >> second;
    int lop;
    int lo = 2;
    int hi = n;
    while (lo <= hi) {
      int mid = (lo + hi) / 2;
      cout << "? ";
      for (int i = 1; i <= mid; i++) cout << 1;
      for (int j = mid + 1; j <= n; j++) cout << 0;
      cout << "\n";
      int ho;
      cin >> ho;
      if (second - ho == mid - 1) {
        lo = mid + 1;
      } else {
        hi = mid - 1;
        lop = mid;
      }
    }
    cout << "! " << lop << " " << 1 << endl;
  }
  return 0;
}
