#include<bits/stdc++.h>
using namespace std;

#define int long long 
#define pb push_back
#define F first 
#define S second

const int mol=998244353;


const int N = 5e4+5;
struct Dsu{
    int dsu[N], sz[N];
    void init(int n){
        for(int i=1;i<=n;i++) dsu[i]=i, sz[i]=1;
    }

    int find(int g){
        if(g==dsu[g]) return g;
        return dsu[g]=find(dsu[g]);
    }
    void un(int g, int h){
        g=find(g), h=find(h);
        if(g>h) swap(g, h);
        dsu[g]=h, sz[h]+=sz[g];
    }
}iu1, iu2;
random_device rnd;
mt19937_64 rng(rnd());
vector<pair<int, int>>e1, e2;
void solve(){
	int n;
	cin>>n;
	iu1.init(n), iu2.init(n);
	for(int i=1;i<=n;i++){
		for(int jj=1;jj<=100000000/n;jj++){
			int j=rng();
			j=abs(j), j%=n, j++;
			if(iu1.find(j)!=iu1.find(i)&&iu2.find(j)!=iu2.find(i)){
				cout<<"? "<<i<<" "<<j<<endl;
				char t;
				cin>>t;
				if(t=='R'){
					iu1.un(i, j);
					e1.pb({i, j});
				}
				else{
					iu2.un(i, j);
					e2.pb({i, j});
				}
			}
			if(e1.size()==n-1||e2.size()==n-1){
				break;
			}
		}
		if(e1.size()==n-1||e2.size()==n-1){
			break;
		}
	}
	cout<<"!"<<endl;
	if(e1.size()!=n-1) e1=e2;
	for(auto tt: e1) cout<<tt.F<<" "<<tt.S<<endl;
}

signed main(){
    ios::sync_with_stdio(0);cin.tie(0);
    // int t;
    // cin>>t;
    // while(t--)

    solve();
    return 0;
}