B'This is an interactive problem. We have hidden an integer 1 <= X <= 10^{9} . You don 't have to guess this number. You have to find the number of divisors of this number, and you don 't even have to find the exact number: your answer will be considered correct if its absolute error is not greater than 7 or its relative error is not greater than 0.5 . More formally, let your answer be ans and the number of divisors of X be d , then your answer will be considered correct if at least one of the two following conditions is true: You can make at most 22 queries. One query consists of one integer 1 <= Q <= 10^{18} . In response, you will get gcd(X, Q) -- the greatest common divisor of X and Q . The number X is fixed before all queries. In other words, interactor is not adaptive. Let 's call the process of guessing the number of divisors of number X a game. In one test you will have to play T independent games, that is, guess the number of divisors T times for T independent values of X . The first line of input contains one integer T ( 1 <= T <= 100 ) -- the number of games. To make a query print a line "? Q" ( 1 <= Q <= 10^{18} ). After that read one integer gcd(X, Q) . You can make no more than 22 such queries during one game. If you are confident that you have figured out the number of divisors of X with enough precision, you can print your answer in "! ans" format. ans have to be an integer. If this was the last game, you have to terminate the program, otherwise you have to start the next game immediately. Note that the interactor doesn 't print anything in response to you printing answer. After printing a query do not forget to output end of line and flush the output. To do this, use: Hacks To hack, use the following format: The first line contains one integer T ( 1 <= T <= 100 ) -- the number of games. Each of '...