import java.util.*; import java.io.*; public class Main { static FastScanner sc = new FastScanner(System.in); static PrintWriter pw = new PrintWriter(System.out); static StringBuilder sb = new StringBuilder(); static long mod = (long) 1e9 + 7; public static void main(String[] args) throws Exception { solve(); pw.flush(); } public static void solve() { int N = sc.nextInt(); int v1 = quest(1); int v2 = 1 - (quest(N - 1) - (N / 2 - 1)); boolean flg = false; if (v1 == v2 && v1 == 0) { int left = 2; int right = N; while (right - left > 1) { int mid = (right + left) / 2; int omote = quest(mid); if (omote * 2 == mid) { if(mid >= N/2){ answer(1, mid); }else{ answer(mid+1,N); } flg = true; break; } else if (omote * 2 > mid) { right = mid; } else { left = mid; } } if (!flg){ if(left >= N/2){ answer(1, left); }else{ answer(left+1,N); } } } else if (v1 == v2 && v1 == 1) { int left = 2; int right = N; while (right - left > 1) { int mid = (right + left) / 2; int omote = quest(mid); if (omote * 2 == mid) { if(mid >= N/2){ answer(1, mid); }else{ answer(mid+1,N); } flg = true; break; } else if (omote * 2 < mid) { right = mid; } else { left = mid; } } if (!flg){ if(left >= N/2){ answer(1, left); }else{ answer(left+1,N); } } } else { answer(2, N - 1); } } public static int quest(int v) { sb.append("?").append(" ").append(v); System.out.println(sb.toString()); sb.setLength(0); return sc.nextInt(); } public static void answer(int v1, int v2) { sb.append("!").append(" ").append(v1).append(" ").append(v2); System.out.println(sb.toString()); sb.setLength(0); return; } static class GeekInteger { public static void save_sort(int[] array) { shuffle(array); Arrays.sort(array); } public static int[] shuffle(int[] array) { int n = array.length; Random random = new Random(); for (int i = 0, j; i < n; i++) { j = i + random.nextInt(n - i); int randomElement = array[j]; array[j] = array[i]; array[i] = randomElement; } return array; } public static void save_sort(long[] array) { shuffle(array); Arrays.sort(array); } public static long[] shuffle(long[] array) { int n = array.length; Random random = new Random(); for (int i = 0, j; i < n; i++) { j = i + random.nextInt(n - i); long randomElement = array[j]; array[j] = array[i]; array[i] = randomElement; } return array; } } } class FastScanner { private BufferedReader reader = null; private StringTokenizer tokenizer = null; public FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } public FastScanner(FileReader in) { reader = new BufferedReader(in); tokenizer = null; } public String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } public long nextLong() { return Long.parseLong(next()); } public int nextInt() { return Integer.parseInt(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String[] nextArray(int n) { String[] a = new String[n]; for (int i = 0; i < n; i++) a[i] = next(); return a; } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } }