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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
import java.text.*;
 
 
 
public class Codeforces {
	
	static int mod=1000_000_007 ;
	static int n,m;
	public static void main(String[] args) throws Exception {
		PrintWriter out=new PrintWriter(System.out);
	    FastScanner fs=new FastScanner();
	    int n=fs.nextInt();
	    boolean edge[][]=new boolean[n][n];
	    ArrayList<Integer> odd=new ArrayList<>(), even=new ArrayList<>();
	    int oc=0, ec=0;
	    System.out.println("? 1");
	    int dist[]=new int[n];
	    dist=fs.readArray(n);
	    for(int i=0;i<n;i++) {
	    	if(dist[i]==1) {
	    		edge[0][i]=edge[i][0]=true;
	    	}
	    	if(dist[i]%2==0) {
	    		if(i!=0) 
	    		even.add(i);
	    		ec++;
	    	}
	    	else {
	    		odd.add(i);
	    		oc++;
	    	}
	    }
	    ArrayList<Integer> check ; 
	    if(ec<=(n+1)/2) {
	    	check=even;
	    }
	    else check=odd;
	 //   System.out.println(check);
	    for(int i : check) {
	    	System.out.println("? "+(i+1));
	    	 dist=fs.readArray(n);
	    	for(int j=0;j<n;j++) {
	    		if(dist[j]==1) edge[i][j]=edge[j][i]=true;
	    	}
	    }
	    
	    System.out.println("!");
	    for(int i=0;i<n;i++) {
	    	for(int j=i+1;j<n;j++) {
	    		if(edge[i][j]) System.out.println(i+1+" "+(j+1));
	    	}
	    }
	    
    }
	
	static boolean color(int r,int c,char arr[][]) {
		
		for(int i=r;i<n;i+=2) {
			for(int j=c;j<m;j+=2) {
				if(arr[i][j]=='.'||arr[i][j]==arr[r][c]) {
					arr[i][j]=arr[r][c];
				}
				else return false;
			}
			for(int j=c;j>=0;j-=2) {
				if(arr[i][j]=='.'||arr[i][j]==arr[r][c]) {
					arr[i][j]=arr[r][c];
				}
				else return false;
			}
		}
		for(int i=r;i>=0;i-=2) {
			for(int j=c;j<m;j+=2) {
				if(arr[i][j]=='.'||arr[i][j]==arr[r][c]) {
					arr[i][j]=arr[r][c];
				}
				else return false;
			}
			for(int j=c;j>=0;j-=2) {
				if(arr[i][j]=='.'||arr[i][j]==arr[r][c]) {
					arr[i][j]=arr[r][c];
				}
				else return false;
			}
		}
	//	System.out.println("hrer");
		return true;
	}
	static long fact(long n) {
		long res=1;
		for(int i=2;i<=n;i++) {
			res*=i;
			res%=mod;
		}
		return res;
	}
	static int gcd(int  a,int  b) {
		if(b==0) return a;
		return gcd(b,a%b);
	}
    static void sort(int[] a) {
		//suffle
		int n=a.length;
		Random r=new Random();
		for (int i=0; i<a.length; i++) {
			int oi=r.nextInt(n);
			int temp=a[i];
			a[i]=a[oi];
			a[oi]=temp;
		}
		
		//then sort
		Arrays.sort(a);
	}
	// Use this to input code since it is faster than a Scanner
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}
		
		int nextInt() {
			return Integer.parseInt(next());
		}
		int[] readArray(int n) {
			int[] a=new int[n];
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		long nextLong() {
			return Long.parseLong(next());
		}
	}
 
}