#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
inline int read()
{
    int x;cin>>x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 1000005
#define inf 0x3f3f3f3f

int n;

vi vec[maxn];
vi e[2][maxn];

int Q(int u,int v){
    cout<<"? "<<u<<" "<<v<<endl;
    char ch;cin>>ch;
    bool w=(ch=='B');
    e[w][u].pb(v);
    e[w][v].pb(u);
    return ch=='B';
}

int col;
vector<pii>res;
bool vis[maxn];
void dfs(int u){
    vis[u]=1;
    for(auto v:e[col][u]){
        if(!vis[v]) res.pb(mkp(u,v)),dfs(v);
    }
}

void work()
{
    cin>>n;
    For(i,2,n){
        int c=Q(1,i);
        vec[!c].pb(i);
    }
    while(vec[0].size() && vec[1].size()){
        int u=vec[0].back();
        int v=vec[1].back();
        int w=Q(u,v);
        if(w==0) vec[0].pop_back();
        else vec[1].pop_back();
    }
    if(!vec[0].size()) col=0;
    else col=1;
    dfs(1);
    assert(res.size()==n-1);
    cout<<"!"<<endl;
    for(auto [u,v]:res) cout<<u<<" "<<v<<endl;
}
/*
8 1
5 8 5 1

*/

signed main()
{
    int T=1;
    while(T--)work();
	return 0;
}