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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.util.Set;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashSet;
import java.io.UncheckedIOException;
import java.util.List;
import java.io.Closeable;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;

/**
 * @author khokharnikunj8
 */
public class Main {
    public static void main(String[] args) throws Exception {
        Thread thread = new Thread(null, new TaskAdapter(), "khokharnikunj8", 1 << 29);
        thread.start();
        thread.join();
    }

    static class TaskAdapter implements Runnable {
        @Override
        public void run() {
            InputStream inputStream = System.in;
            OutputStream outputStream = System.out;
            FastInput in = new FastInput(inputStream);
            FastOutput out = new FastOutput(outputStream);
            DLostTree solver = new DLostTree();
            solver.solve(1, in, out);
            out.close();
        }
    }

    static class DLostTree {
        public Set<Long> st;

        public int[] ask(int node, FastInput in, FastOutput out, int n) {
            out.println("? " + node);
            out.flush();
            int[] ar = new int[n + 1];
            for (int i = 1; i <= n; i++) ar[i] = in.readInt();
            return ar;
        }

        public void add(int i, int j) {
            int min = Math.min(i, j);
            int max = Math.max(i, j);
            st.add(min * 10000000l + max);
        }

        public boolean contains(int i, int j) {
            int min = Math.min(i, j);
            int max = Math.max(i, j);
            return st.contains(min * 10000000l + max);
        }

        public void solve(int testNumber, FastInput in, FastOutput out) {
            int n = in.readInt();
            int[] ar = new int[n];
            st = new HashSet<>();
            for (int i = 0; i < n; i++) ar[i] = i + 1;
            List<int[]> ans = new ArrayList<>();

            int[][] distance = new int[n + 1][n + 1];
            distance[1] = ask(1, in, out, n);
            int[] count = new int[2];
            for (int i = 1; i <= n; i++) {
                count[distance[1][i] % 2]++;
                if (distance[1][i] == 1) {
                    if (!contains(1, i)) {
                        add(1, i);
                        ans.add(new int[]{1, i});
                    }
                }
            }
            int which = (count[0] <= (n / 2) + n % 2) ? 0 : 1;

            for (int i = 2; i <= n; i++) {
                if (distance[1][i] % 2 == which) {
                    distance[i] = ask(i, in, out, n);
                    for (int j = 1; j <= n; j++) {
                        if (distance[i][j] == 1 && !contains(i, j)) {
                            add(i, j);
                            ans.add(new int[]{i, j});
                        }
                    }
                }
            }

            if (ans.size() != n - 1) throw new RuntimeException();
            out.println("!");
            out.flush();
            for (int[] pair : ans) {
                out.println(pair[0] + " " + pair[1]);
                out.flush();
            }

        }

    }

    static class FastOutput implements AutoCloseable, Closeable, Appendable {
        private final Writer os;
        private final StringBuilder cache = new StringBuilder(5 << 20);

        public FastOutput(Writer os) {
            this.os = os;
        }

        public FastOutput(OutputStream os) {
            this(new OutputStreamWriter(os));
        }

        public FastOutput append(CharSequence csq) {
            cache.append(csq);
            return this;
        }

        public FastOutput append(CharSequence csq, int start, int end) {
            cache.append(csq, start, end);
            return this;
        }

        public FastOutput append(char c) {
            cache.append(c);
            return this;
        }

        public FastOutput append(String c) {
            cache.append(c);
            return this;
        }

        public FastOutput println(String c) {
            return append(c).println();
        }

        public FastOutput println() {
            cache.append(System.lineSeparator());
            return this;
        }

        public FastOutput flush() {
            try {
                os.append(cache);
                os.flush();
                cache.setLength(0);
            } catch (IOException e) {
                throw new UncheckedIOException(e);
            }
            return this;
        }

        public void close() {
            flush();
            try {
                os.close();
            } catch (IOException e) {
                throw new UncheckedIOException(e);
            }
        }

        public String toString() {
            return cache.toString();
        }

    }

    static class FastInput {
        private final InputStream is;
        private final byte[] buf = new byte[1 << 13];
        private int bufLen;
        private int bufOffset;
        private int next;

        public FastInput(InputStream is) {
            this.is = is;
        }

        private int read() {
            while (bufLen == bufOffset) {
                bufOffset = 0;
                try {
                    bufLen = is.read(buf);
                } catch (IOException e) {
                    bufLen = -1;
                }
                if (bufLen == -1) {
                    return -1;
                }
            }
            return buf[bufOffset++];
        }

        public void skipBlank() {
            while (next >= 0 && next <= 32) {
                next = read();
            }
        }

        public int readInt() {
            int sign = 1;

            skipBlank();
            if (next == '+' || next == '-') {
                sign = next == '+' ? 1 : -1;
                next = read();
            }

            int val = 0;
            if (sign == 1) {
                while (next >= '0' && next <= '9') {
                    val = val * 10 + next - '0';
                    next = read();
                }
            } else {
                while (next >= '0' && next <= '9') {
                    val = val * 10 - next + '0';
                    next = read();
                }
            }

            return val;
        }

    }
}

