This is an interactive problem.

Homer likes arrays a lot and he wants to play a game with you. 

Homer has hidden from you a permutation a_1, a_2, ..., a_n of integers 1 to n. You are asked to find any index k (1 ≤ k ≤ n) which is a local minimum. 

For an array a_1, a_2, ..., a_n, an index i (1 ≤ i ≤ n) is said to be a local minimum if a_i < min\\{a_{i-1},a_{i+1}\}, where a_0 = a_{n+1} = +∞. An array is said to be a permutation of integers 1 to n, if it contains all integers from 1 to n exactly once.

Initially, you are only given the value of n without any other information about this permutation.

At each interactive step, you are allowed to choose any i (1 ≤ i ≤ n) and make a query with it. As a response, you will be given the value of a_i. 

You are asked to find any index k which is a local minimum after at most 100 queries.

Interaction

You begin the interaction by reading an integer n (1≤ n ≤ 10^5) on a separate line.

To make a query on index i (1 ≤ i ≤ n), you should output "? i" in a separate line. Then read the value of a_i in a separate line. The number of the "?" queries is limited within 100.

When you find an index k (1 ≤ k ≤ n) which is a local minimum, output "! k" in a separate line and terminate your program. 

In case your query format is invalid, or you have made more than 100 "?" queries, you will receive Wrong Answer verdict. 

After printing a query do not forget to output end of line and flush the output. Otherwise, you will get Idleness limit exceeded. To do this, use:

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



Hack Format

The first line of the hack should contain a single integer n (1 ≤ n ≤ 10^5).

The second line should contain n distinct integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ n).

Example

Input


5
3
2
1
4
5


Output


? 1
? 2
? 3
? 4
? 5
! 3

Note

In the example, the first line contains an integer 5 indicating that the length of the array is n = 5.

The example makes five "?" queries, after which we conclude that the array is a = [3,2,1,4,5] and k = 3 is local minimum.
//make sure to make new file!
import java.io.*;
import java.util.*;

public class A700{

   public static BufferedReader f;
   public static PrintWriter out;
   public static int n;
   
   public static void main(String[] args)throws IOException{
      f = new BufferedReader(new InputStreamReader(System.in));
      out = new PrintWriter(System.out);
      
      n = Integer.parseInt(f.readLine());
      
      int l = 1;
      int r = n;
      int ans = -1;
      while(l <= r){
         int mid = l + (r-l)/2;
         int queryi = query(mid);
         if(queryi == 0){
            ans = mid;
            break;
         } else if(queryi == -1){
            r = mid-1;
         } else if(queryi == 1){
            l = mid+1;
         }
      }
      
      out.println("! " + ans);
      
      
      
      
      
      
      
      
      out.close();
   }
   
   //returns -1 if decreasing (so go left), 0 if min, 1 if increasing
   public static int query(int i)throws IOException{
      int a = Integer.MAX_VALUE;
      int b = Integer.MAX_VALUE;
      int c = Integer.MAX_VALUE;
      if(i > 1){
         out.println("? " + (i-1));
         out.flush();
         
         a = Integer.parseInt(f.readLine());
      }
      out.println("? " + i);
      out.flush();
      
      b = Integer.parseInt(f.readLine());
      
      if(i < n){
         out.println("? " + (i+1));
         out.flush();
      
         c = Integer.parseInt(f.readLine());
      }
      
      if(b < a && b < c) return 0;
      if(b < a && b > c) return 1;
      if(b > a && b < c) return -1;
      //local max, go in either direction
      return 1;
      
   }
      
}