#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000404;
const long long MOD = 1000000007ll;
const long double PI = acos(-1.0);
const long long INF = 1000000000000000404ll;
const long double EPS = 1e-9;
template <typename t1, typename t2>
inline void upmax(t1 &a, t2 b) {
  a = max(a, (t1)b);
}
template <typename t1, typename t2>
inline void upmin(t1 &a, t2 b) {
  a = min(a, (t1)b);
}
template <typename T>
inline T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <typename T>
inline T lcm(T a, T b) {
  return a * (b / gcd(a, b));
}
template <typename T>
inline T sqr(T a) {
  return a * a;
}
inline bool pal(string &x) {
  int n = (int)x.length();
  for (int i = 0; i < n / 2; i++) {
    if (x[i] != x[n - i - 1]) return 0;
  }
  return 1;
}
template <typename T>
inline void rev(T &x) {
  int n = (int((x.size())));
  for (int i = 0; i < n / 2; i++) swap(x[i], x[n - i - 1]);
}
int month[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
class compare {
 public:
  bool operator()(const int a, const int b) const { return 1; }
};
int SQ = 400;
void solve() {
  int n;
  cin >> n;
  int l = 0;
  int r = n - 1;
  int x, y;
  y = n;
  string s;
  for (int i = 0; i < n; i++) {
    s += '0';
  }
  int H;
  string shab = s;
  cout << "? " << s << endl;
  cin >> H;
  H = n - H;
  int NH;
  pair<int, int> ans;
  ans.first = -1;
  ans.second = -1;
  while (l < r) {
    int x = (l + r) / 2;
    if (l == r - 1) {
      string s1 = s, s2 = s;
      int H1, H2;
      s1[l] = '1';
      s2[r] = '1';
      cout << "? " << s1 << endl;
      cin >> H1;
      H1 = n - H1;
      if (H1 == H + 1) {
        ans.second = l;
      } else
        ans.first = l;
      cout << "? " << s2 << endl;
      cin >> H2;
      H2 = n - H2;
      if (H2 == H + 1) {
        ans.second = r;
      } else
        ans.first = r;
      break;
    }
    for (int i = x; i < r + 1; i++) s[i] = '1';
    cout << "? " << s << endl;
    s = shab;
    cin >> NH;
    NH = n - NH;
    if (abs(NH - H) == r - x + 1) {
      if (NH > H)
        ans.second = x;
      else
        ans.first = x;
      r = x - 1;
    } else {
      l = x;
    }
  }
  if (ans.first == -1) ans.first = l;
  if (ans.second == -1) ans.second = l;
  cout << '!' << ' ' << ans.first + 1 << ' ' << ans.second + 1 << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  };
  getchar();
  getchar();
  return 0;
}
