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.util.*;
import java.io.*;
//import java.math.*;

public class Task{
        //..............code begins here..............
static long mod=(long)1e9+7,mod1=998244353l,inf=(long)1e17;
static int dx[]=new int[]{1,0,0};
static int dy[]=new int[]{0,1,-1};
static int[] ask(int x) throws IOException{
    out.write("? "+x+"\n");
    out.flush();
    return int_arr();
}
static void solve() throws IOException {
        int n=int_v(read());
        int[] a=ask(1);
        int c=0;
        List<int[]> l=new ArrayList<>();
        boolean[] b=new boolean[n+1];
        b[1]=true;
        for(int i=0;i<n;i++){
            if(a[i]%2==0)c++;
            if(a[i]==1){l.add(new int[]{1,i+1});b[i+1]=true;}
        }
        List<Integer> l1=new ArrayList<>();
        for(int i=2;i<=n;i++){
            if(c<=n-c){
                if(a[i-1]%2==0)l1.add(i);
            }
            else if(a[i-1]%2==1)l1.add(i);
        }
        if(c>n-c)l.clear();
        for(int j:l1){
            int[] z=ask(j);
            for(int i=0;i<n;i++){
                if(z[i]==1){
                    l.add(new int[]{j,i+1});
                    b[j]=true;b[i+1]=true;
                }
            }
        }
        out.write("!\n");
        for(int[] e:l)out.write(e[0]+" "+e[1]+"\n");
}

public static void main(String[] args) throws  IOException{
        assign();
        int t=1;//int_v(read());
        int cn=1;
        while(t--!=0){
            //out.write("Case #"+cn+": ");
            solve();
            cn++;
        }
        out.flush();
}

// taking inputs
static BufferedReader s1;
static BufferedWriter out;
static String read() throws IOException{String line="";while(line.length()==0){line=s1.readLine();continue;}return line;}
static int int_v (String s1){return Integer.parseInt(s1);}
static long long_v(String s1){return Long.parseLong(s1);}
static void sort(int[] a){List<Integer> l=new ArrayList<>();for(int x:a){l.add(x);}Collections.sort(l);for(int i=0;i<a.length;i++){a[i]=l.get(i);}}
static int[] int_arr() throws IOException{String[] a=read().split(" ");int[] b=new int[a.length];for(int i=0;i<a.length;i++){b[i]=int_v(a[i]);}return b;}
static long[] long_arr() throws IOException{String[] a=read().split(" ");long[] b=new long[a.length];for(int i=0;i<a.length;i++){b[i]=long_v(a[i]);}return b;}
static void assign(){s1=new BufferedReader(new InputStreamReader(System.in));out=new BufferedWriter(new OutputStreamWriter(System.out));}
//static String setpreciosion(double d,int k){BigDecimal d1 = new BigDecimal(Double.toString(d));return d1.setScale(k,RoundingMode.HALF_UP).toString();}//UP DOWN HALF_UP
static int add(int a,int b){int z=a+b;if(z>=mod)z-=mod;return z;}
static long gcd(long a,long b){if(b==0){return a;}return gcd(b,a%b);}
static long Modpow(long a,long p,long m){long res=1;while(p>0){if((p&1)!=0){res=(res*a)%m;}p >>=1;a=(a*a)%m;}return res%m;}
static long Modmul(long a,long b,long m){return ((a%m)*(b%m))%m;}
static long ModInv(long a,long m){return Modpow(a,m-2,m);}
//static long nck(int n,int r,long m){if(r>n){return 0l;}return Modmul(f[n],ModInv(Modmul(f[n-r],f[r],m),m),m);}
//static long[] f;
}