Problem: Mahmoud and Ehab are in the fourth stage now.

Dr. Evil has a hidden binary string of length n. He guarantees that there is at least one '0' symbol and at least one '1' symbol in it. Now he wants Mahmoud and Ehab to find a position of any '0' symbol and any '1' symbol. In order to do this, Mahmoud and Ehab can ask Dr. Evil up to 15 questions. They tell Dr. Evil some binary string of length n, and Dr. Evil tells the Hamming distance between these two strings. Hamming distance between 2 binary strings of the same length is the number of positions in which they have different symbols. You can find the definition of Hamming distance in the notes section below.

Help Mahmoud and Ehab find these two positions.

You will get Wrong Answer verdict if 

  * Your queries doesn't satisfy interaction protocol described below. 
  * You ask strictly more than 15 questions and your program terminated after exceeding queries limit. Please note, that you can do up to 15 ask queries and one answer query. 
  * Your final answer is not correct. 

You will get Idleness Limit Exceeded if you don't print anything or if you forget to flush the output, including for the final answer (more info about flushing output below).

If you exceed the maximum number of queries, You should terminate with 0, In this case you'll get Wrong Answer, If you don't terminate you may receive any verdict because you'll be reading from a closed stream .

Input

The first line of input will contain a single integer n (2 ≤ n ≤ 1000) — the length of the hidden binary string.

Output

To print the final answer, print "! pos0 pos1" (without quotes), where pos0 and pos1 are positions of some '0' and some '1' in the string (the string is 1-indexed). Don't forget to flush the output after printing the answer!

Interaction

To ask a question use the format "? s" (without quotes), where s is a query string. Don't forget to flush the output after printing a query!

After each query you can read a single integer from standard input — the Hamming distance between the hidden string and the query string.

To flush the output you can use:- 

  * fflush(stdout) in C++; 
  * System.out.flush() in Java; 
  * stdout.flush() in Python; 
  * flush(output) in Pascal; 
  * See the documentation for other languages . 



Hacking.

To hack someone just print one binary string with length up to 1000, containing at least one '0' and at least one '1'.

Example

Input

3
2
1
3
2
1
0

Output

? 000
? 001
? 010
? 011
? 100
? 101
! 2 1

Note

Hamming distance definition: <https://en.wikipedia.org/wiki/Hamming_distance>

In the first test case the hidden binary string is 101, The first query is 000, so the Hamming distance is 2. In the second query the hidden string is still 101 and query is 001, so the Hamming distance is 1.

After some queries you find that symbol at position 2 is '0' and symbol at position 1 is '1', so you print "! 2 1".

Solution (in JAVA):

Solution:
import java.io.*;
import java.lang.*;
import java.util.*;

public class Main {
  public static void main(String args[]) { new Main().out.flush(); }
  PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out), false);
  BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  StringTokenizer st = null;
  String nxttok() {
    try { while (st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine()); }
    catch (IOException e) { throw new RuntimeException(e); }
    return st.nextToken();
  }
  int nxtint() { return Integer.parseInt(nxttok()); }
  long nxtlong() { return Long.parseLong(nxttok()); }
  double nxtdouble() { return Double.parseDouble(nxttok()); }

  /////////////////////////////////////////////////////////////
  
  char s[] = {'0', '1'};
  char[] rep(int ch, int n) {
    char[] ans = new char[n];
    while (n-- > 0) ans[n] = s[ch];
    return ans;
  }

  void reverse(char[] x, int l, int r) {
    for (int i = l; i <= r; ++i) {
      x[i] = x[i] == '0' ? '1' : '0';
    }
  }

  int ask(char[] t) {
    System.out.print("? ");
    System.out.println(t);
    System.out.flush();
    return nxtint();
  }

  int n;
  int found;
  int pos[] = new int[2];

  Main() {
    n = nxtint();

    char[] t = rep(0, n);
    int u = ask(t);
    t[n - 1] = '1';
    int v = ask(t);
    if (u < v) {
      found = 0;
    } else {
      found = 1;
    }
    System.err.println("found " + found + " " + n);
    pos[found] = n;

    t[n - 1] = '0';
    int l = 0, r = n - 2, lastans = u;
    while (l < r) {
      int mid = l + (r - l) / 2;
      reverse(t, l, mid);
      int nf = ask(t), f = lastans;
      lastans = nf;
      if (t[l] == s[found ^ 1]) {
        int temp = nf;
        nf = f;
        f = temp;
      }
      System.err.println("nf f " + nf + " " + f);
      if (f - nf == mid - l + 1) {
        // left side dont have it
        System.err.println("no left");
        l = mid + 1;
      } else {
        r = mid;
      }
    }
    pos[found ^ 1] = l + 1;
    System.out.print("! " + pos[0] + " " + pos[1]);
    System.out.flush();
  }
}