#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int N = 2e3+3;

int n,a[N][N]; 

int ask(int x,int y){
	cout<<"? "<<x<<" "<<y<<endl;
	int res;
	cin>>res;
	return res;
}

int mx,ax,ay;

void on(int x,int y){
	if (1<=x && x<=n && 1<=y && y<=n){
		if (!a[x][y]) a[x][y]=ask(x,y);
		if (a[x][y]>mx) mx=a[x][y],ax=x,ay=y;
	}
}

void chk(int x,int y){
	on(x-1,y-1),on(x-1,y),on(x-1,y+1);
	on(x,y-1),on(x,y+1);
	on(x+1,y-1),on(x+1,y),on(x+1,y+1);
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin>>n;
	int l=1,r=n,u=1,d=n;
	while (l<r || u<d){
		if (r-l+1<=d-u+1){
			int mid=u+d>>1;
			for (int i=l; i<=r; i++) on(mid,i);
			chk(ax,ay);
			if (ax<=mid) d=mid;
			else u=mid+1;
		}
		else{
			int mid=l+r>>1;
			for (int i=u; i<=d; i++) on(i,mid);
			chk(ax,ay);
			if (ay<=mid) r=mid;
			else l=mid+1;
		}
	}
	cout<<"! "<<ax<<" "<<ay<<endl;
	return 0;
}

// TRY! TRY! TRY!

/*
Think twice before coding. Have you overkilled?
Think twice before submitting.
Check on the samples and constraints carefully.
*/

/*
Be brave to guess.
Is your former/first approach correct?
Follow your intuition.
Use a notebook to note down your ideas and check whether they are correct.
*/

/*
A simple brute force may work? There is some limit on the answer?
Try to find patterns.
*/