Problem: This is an interactive problem.

Imur Ishakov decided to organize a club for people who love to play the famous game «The hat». The club was visited by n students, where n is even. Imur arranged them all in a circle and held a draw to break the students in pairs, but something went wrong. The participants are numbered so that participant i and participant i + 1 (1 ≤ i ≤ n - 1) are adjacent, as well as participant n and participant 1. Each student was given a piece of paper with a number in such a way, that for every two adjacent students, these numbers differ exactly by one. The plan was to form students with the same numbers in a pair, but it turned out that not all numbers appeared exactly twice.

As you know, the most convenient is to explain the words to the partner when he is sitting exactly across you. Students with numbers i and <image> sit across each other. Imur is wondering if there are two people sitting across each other with the same numbers given. Help him to find such pair of people if it exists.

You can ask questions of form «which number was received by student i?», and the goal is to determine whether the desired pair exists in no more than 60 questions.

Input

At the beginning the even integer n (2 ≤ n ≤ 100 000) is given — the total number of students.

You are allowed to ask no more than 60 questions.

Output

To ask the question about the student i (1 ≤ i ≤ n), you should print «? i». Then from standard output you can read the number ai received by student i ( - 109 ≤ ai ≤ 109).

When you find the desired pair, you should print «! i», where i is any student who belongs to the pair (1 ≤ i ≤ n). If you determined that such pair doesn't exist, you should output «! -1». In both cases you should immediately terminate the program.

The query that contains your answer is not counted towards the limit of 60 queries.

Please make sure to flush the standard output after each command. For example, in C++ use function fflush(stdout), in Java call System.out.flush(), in Pascal use flush(output) and stdout.flush() for Python language.

Hacking

Use the following format for hacking:

In the first line, print one even integer n (2 ≤ n ≤ 100 000) — the total number of students.

In the second line print n integers ai ( - 109 ≤ ai ≤ 109) separated by spaces, where ai is the number to give to i-th student. Any two adjacent elements, including n and 1, must differ by 1 or  - 1.

The hacked solution will not have direct access to the sequence ai.

Examples

Input

8
<span class="tex-span"></span>
2
<span class="tex-span"></span>
2


Output

<span class="tex-span"></span>
? 4
<span class="tex-span"></span>
? 8
<span class="tex-span"></span>
! 4


Input

6
<span class="tex-span"></span>
1
<span class="tex-span"></span>
2
<span class="tex-span"></span>
3 
<span class="tex-span"></span>
2
<span class="tex-span"></span>
1
<span class="tex-span"></span>
0

Output

<span class="tex-span"></span>
? 1
<span class="tex-span"></span>
? 2
<span class="tex-span"></span>
? 3
<span class="tex-span"></span>
? 4
<span class="tex-span"></span>
? 5
<span class="tex-span"></span>
? 6
<span class="tex-span"></span>
! -1

Note

Input-output in statements illustrates example interaction.

In the first sample the selected sequence is 1, 2, 1, 2, 3, 4, 3, 2

In the second sample the selection sequence is 1, 2, 3, 2, 1, 0.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long LINF = (long long)1e18 + 1e9 + 123;
int n;
int ask(int i) {
  i = (i - 1) % n + 1;
  cout << "? " << i << endl;
  int result;
  cin >> result;
  return result;
}
void answer(int i) {
  if (i != -1) {
    i = (i - 1) % n + 1;
  }
  cout << "! " << i << endl;
  exit(0);
}
int f(int i) { return ask(i + n / 2) - ask(i); }
int sgn(int x) {
  if (x == 0) {
    return 0;
  }
  return x < 0 ? -1 : 1;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  int left = 1;
  int right = 1 + n / 2;
  int f_left = f(left);
  int f_right = f(right);
  assert(f_right == -f_left);
  if (f_left % 2 != 0) {
    answer(-1);
  }
  if (f_left == 0) {
    answer(1);
  }
  while (right - left > 1) {
    int mid = (left + right) / 2;
    int f_mid = f(mid);
    if (f_mid == 0) {
      answer(mid);
    }
    if (sgn(f_mid) == sgn(f_left)) {
      left = mid;
      f_left = f_mid;
    } else {
      assert(sgn(f_mid) == sgn(f_right));
      right = mid;
      f_right = f_mid;
    }
  }
  assert(false);
  return 0;
}