#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 1111;
int n, dp[maxn][2];
int query(int l, int r, int k) {
  if (l == 1)
    if (dp[r][k] != -1) return dp[r][k];
  cout << "? ";
  for (int i = 1; i <= l - 1; ++i) cout << 1 - k;
  for (int i = l; i <= r; ++i) cout << k;
  for (int i = r + 1; i <= n; ++i) cout << 1 - k;
  cout << endl;
  int res;
  cin >> res;
  if (l == 1) dp[r][k] = res;
  return res;
}
int ans;
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  memset(dp, -1, sizeof(dp));
  int state = query(1, n, 0) > query(2, n, 0);
  int l = 1, r = n;
  while (l <= r) {
    int mid = (l + r) / 2;
    if (query(1, mid, state) == query(1, n, state) + n - mid) {
      ans = mid;
      r = mid - 1;
    } else
      l = mid + 1;
  }
  if (!state) {
    cout << "! " << 1 << " " << ans << endl;
  } else {
    cout << "! " << ans << " " << 1 << endl;
  }
  return 0;
}
