5
5 3
2 4
3 1
4 5
 4
2 4
3 2
2 1
 5
5 3
2 4
3 1
4 5
 2
1 2
 4
3 4
2 3
3 1
 10
8 10
2 9
7 8
4 1
7 3
4 7
2 5
2 4
4 6
 5
3 4
3 2
3 1
1 5
 3
1 2
2 3
 5
1 2
1 3
1 4
1 5

1 2
2 3
2 4
 1 3
2 4
3 5
4 5
 1 2
 1 3
2 3
3 4
 1 4
2 4
2 5
2 9
3 7
4 6
4 7
7 8
8 10
 1 3
1 5
2 3
3 4
 1 2
2 3
 1 2
1 3
1 4
1 5

import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
import java.util.BitSet;
import java.util.function.BinaryOperator;

public class D {
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    static FastReader s = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);

    private static int[] rai(int n) {
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = s.nextInt();
        }
        return arr;
    }

    private static int[][] rai(int n, int m) {
        int[][] arr = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                arr[i][j] = s.nextInt();
            }
        }
        return arr;
    }

    private static long[] ral(int n) {
        long[] arr = new long[n];
        for (int i = 0; i < n; i++) {
            arr[i] = s.nextLong();
        }
        return arr;
    }

    private static long[][] ral(int n, int m) {
        long[][] arr = new long[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                arr[i][j] = s.nextLong();
            }
        }
        return arr;
    }

    private static int ri() {
        return s.nextInt();
    }

    private static long rl() {
        return s.nextLong();
    }

    private static String rs() {
        return s.next();
    }

    static int gcd(int a,int b)
    {
        if(b==0)
        {
            return a;
        }
        return gcd(b,a%b);
    }
    static long gcd(long a,long b)
    {
        if(b==0)
        {
            return a;
        }
        return gcd(b,a%b);
    }

    static int MOD=(int)1e9+7;

    public static int primeFactors(long n)
    {
        // Print the number of 2s that divide n
        int count=0;
        while (n % 2 == 0) {
            count++;
            n /= 2;
        }

        // n must be odd at this point.  So we can
        // skip one element (Note i = i +2)
        for (long i = 3; i * i<=n; i += 2) {
            // While i divides n, print i and divide n
            while (n % i == 0) {
                count++;
                n /= i;
            }
        }

        // This condition is to handle the case whien
        // n is a prime number greater than 2
        if (n > 2)
            count++;

        return count;
    }
    static int factors(int n)
    {
        HashSet<Integer> set=new HashSet<>();
        for(int i=1;i*i<=n;i++)
        {
            if(n%i==0)
            {
                set.add(i);
                set.add(n/i);
            }
        }
        return set.size()-1;
    }

    static List<Integer> primes = new ArrayList<>();
    static int countPF(int x) {
        int count=0;
        for (int i:primes) {
            while (x%i==0) {
                count++;
                x/=i;
            }
        }
        if (x>1) count++;
        return count;
    }
    public static void main(String[] args) {
        StringBuilder ans = new StringBuilder();
//        int t = ri();
        int t=1;
        while(t-- >0)
        {
            int n=ri();


            HashSet<String> set=new HashSet<>();
            HashSet<Integer> asked = new HashSet<>();

            int toAsk = 1;

            while(asked.size()<n) {

                out.println("? " + toAsk);
                out.flush();
                int[] arr = rai(n);
                asked.add(1);
                List<Integer>[] list = new ArrayList[n];

                int max = 0;
                for (int i = 0; i < n; i++) {
                    if (list[arr[i]] == null) {
                        list[arr[i]] = new ArrayList<>();
                    }

                    max = Math.max(arr[i], max);
                    list[arr[i]].add(i+1);
                }

                for (int i = 0; i < max; i++) {
                    if (list[i] != null && list[i].size() == 1) {
                        for (int j : list[i]) {
                            for (int k : list[i + 1]) {
                                String str = Math.min(j,k) + " " +
                                        Math.max(j, k);
                                set.add(str);
                                asked.add(j);
                                asked.add(k);

                            }
                        }
                    }
                }

//                out.println(asked);
//                out.println(list[max]);
//                out.flush();
                boolean found = false;
                for(int j=max;j>=0;j--) {
                    if(list[j]==null)
                    {
                        continue;
                    }
                    for (int i : list[j]) {
                        if (!asked.contains(i)) {
                            toAsk = i;
                            found=true;
                            break;
                        }
                    }
                    if(found)
                    {
                        break;
                    }
                }
            }
            out.println("!");
            for(String res:set)
            {
                out.println(res);
            }
            out.flush();





        }
//        out.print(ans.toString());
//        out.flush();

    }
//0 1 2 2 3 3 1 1
//3 2 3 1 0 2 4 4
//2 1 0 2 3 3 3 3
}