#include<cstdio>
#include<bitset>
#include<algorithm>
#define TY int
#define MAXN 102
#define MAXM 5002
#define FOR(i,a,b) for(TY i=(a);i<=(b);i=-~i)
#define fOR(i,a,b) for(TY i=(a);i<(b);i=-~i)
#define ROF(i,a,b) for(TY i=(a);i>=(b);i=~-i)
#define rOF(i,a,b) for(TY i=(a);i>(b);i=~-i)
#define EDG(i,u) for(TY i=hed[u];i;i=nxt[i])
using namespace std;
typedef long long ll;
const TY M=998244353;
typedef unsigned long long ull;
TY _abs(TY a){return a<0?-a:a;}
TY maxn(TY a,TY b){return a>b?a:b;}
TY minn(TY a,TY b){return a<b?a:b;}
inline void updmx(TY &x,TY y){if(x<y)x=y;}
inline void updmn(TY &x,TY y){if(x>y)x=y;}
inline void add(TY &x,TY y){if((x+=y)>=M)x-=M;}
TY gcd(TY a,TY b){return b?gcd(b,a%b):a;}
TY qp(TY a,TY b){TY ans=1;do{if(1&b)ans=ans*a%M;a=a*a%M;}while(b>>=1);return ans;}
char getc(){char ch=getchar();while(ch==' '||ch=='\n'||ch=='\r')ch=getchar();return ch;}
TY qr(){
	char ch=getchar();TY s=0,x=1;
	for(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')x=-1;
	for(;ch>='0'&&ch<='9';ch=getchar())s=s*10+ch-'0';return x*s;
}void qw(TY a){if(a>9)qw(a/10);putchar(a%10+'0');}
void qw(TY a,char ch){
	if(a<0){a=-a;putchar('-');}
	if(a>9)qw(a/10);putchar(a%10+'0');if(ch)putchar(ch);
}TY n=qr(),b[MAXN],ar[MAXN],ct,u[MAXN],v[MAXN],ps,id[MAXN][MAXN];
bitset<MAXN>sd[MAXN];bitset<MAXM>F[MAXM],G[MAXM];char ans[MAXM][MAXM];bool vs[MAXN];
bool cmp(TY x,TY y){
	TY p=id[x][b[x]],q=id[y][b[y]];
	return F[p].count()*G[q].count()<F[q].count()*G[p].count();
}bool ask(TY u1,TY v1,TY u2,TY v2){
	if(u1>v1)u1^=v1^=u1^=v1;
	if(u2>v2)u2^=v2^=u2^=v2;
	TY p=id[u1][v1],q=id[u2][v2];
	if(p>q)return !ask(u2,v2,u1,v1);
	if(~ans[p][q])return ans[p][q];
	printf("? %d %d %d %d\n",u1,v1,u2,v2);fflush(stdout);
	if(ans[p][q]=qr()){
		for(TY i=G[p]._Find_first();i<MAXM;i=G[p]._Find_next(i))F[i]|=F[q];
		for(TY i=F[q]._Find_first();i<MAXM;i=F[q]._Find_next(i))G[i]|=G[p];
	}else{
		for(TY i=G[q]._Find_first();i<MAXM;i=G[q]._Find_next(i))F[i]|=F[p];
		for(TY i=F[p]._Find_first();i<MAXM;i=F[p]._Find_next(i))G[i]|=G[q];
	}return ans[p][q];
}int main(){
	ct=0;FOR(i,1,n)FOR(j,i+1,n)id[i][j]=id[j][i]=++ct;
	FOR(i,1,ct)FOR(j,i+1,ct)ans[i][j]=-1;
	FOR(i,1,n)sd[i][i]=b[i]=1;
	FOR(i,1,ct)F[i][i]=G[i][i]=1;
	fOR(x,1,n){
		ct=0;FOR(i,2,n)if(!vs[i]&&sd[i].count()==1)ar[++ct]=i;
		sort(ar+1,ar+ct+1,cmp);
		ps=ar[1];FOR(i,2,ct){
			if(ask(ps,b[ps],ar[i],b[ar[i]])){
				FOR(j,2,n)if(sd[j][ar[i]])sd[j]|=sd[ps];
			}else{FOR(j,2,n)if(sd[j][ps])sd[j]|=sd[ar[i]];ps=ar[i];}
		}u[x]=minn(ps,b[ps]);v[x]=maxn(ps,b[ps]);
		vs[ps]=true;FOR(i,1,n)sd[i][ps]=sd[ps][i]=0;
		FOR(i,2,n)if(!vs[i]&&!ask(i,b[i],i,ps))
			{b[i]=ps;FOR(j,2,n)if(i!=j)sd[i][j]=0;}
	}printf("! ");fOR(i,1,n){qw(u[i],' ');qw(v[i],' ');}
	fflush(stdout);return 0;
}