B"This is an interactive problem. You have to use flush operation right after printing each line. For example, in C++ you should use the function fflush(stdout), in Java or Kotlin -- System.out.flush(), and in Python -- sys.stdout.flush(). The jury has a string s consisting of characters 0 and/or 1. The first character of this string is 0. The length of this string is n . You have to guess this string. Let's denote s[l..r] as the substring of s from l to r (i. xe2 x80 x89e. s[l..r] is the string s_ls_{l+1} ... s_r ). Let the prefix function of the string s be an array [p_1, p_2, ... , p_n] , where p_i is the greatest integer j in [0, i-1] such that s[1..j] = s[i-j+1..i] . Also, let the antiprefix function of the string s be an array [q_1, q_2, ... , q_n] , where q_i is the greatest integer j in [0, i-1] such that s[1..j] differs from s[i-j+1..i] in every position. For example, for the string 011001, its prefix function is [0, 0, 0, 1, 1, 2] , and its antiprefix function is [0, 1, 1, 2, 3, 4] . You can ask queries of two types to guess the string s : You have to guess the string by asking no more than 789 queries. Note that giving the answer does not count as a query. In every test and in every test case, the string s is fixed beforehand. Initially, the jury program sends one integer t ( 1 <= t <= 100 ) -- the number of test cases. At the start of each test case, the jury program sends one integer n ( 2 <= n <= 1000 ) -- the length of the string. After that, your program can submit queries to the jury program by printing one of the following lines (do not forget to flush the output after printing a line!): For every query, the jury prints one integer on a separate line. It is either: To submit the answer, your program should send a line in the following format (do not forget to flush the output after "...