#include<bits/stdc++.h>
#define For(i,x,y) for (int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (int i=(x);i<(y);i++)
#define Dow(i,x,y) for (int i=(x);i>=(y);i--)
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define ep emplace_back
#define siz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define fil(a,b) memset((a),(b),sizeof(a))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pa;
typedef pair<ll,ll> PA;
typedef vector<int> poly;
inline ll read(){
	ll x=0,f=1;char c=getchar();
	while ((c<'0'||c>'9')&&(c!='-')) c=getchar();
	if (c=='-') f=-1,c=getchar();
	while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
	return x*f;
}

const int N = 510;
int n,m=1e5;

int tot,rt,ls[N],rs[N],t[N];
inline int cmp(int x,int y,int z){
	cout<<"? "<<x-1<<" "<<y-1<<" "<<z<<endl;
	static char ret[10];
	scanf("%s",ret);
	return ret[0]=='F';
}
inline void insert(int &u,int l,int r,int x){
	if (!u){
		u=++tot,t[u]=x;
		return;
	}
	int mid=l+r>>1;
	if (cmp(x,t[u],mid)) swap(t[u],x);
	if (cmp(x,t[u],l)) insert(ls[u],l,mid,x);
	else if (cmp(x,t[u],r)) insert(rs[u],mid+1,r,x);  
}
int ans;
inline void Query(int u,int l,int r,int ql){
	if (!u) return;
	if (!ans||cmp(t[u],ans,ql)) ans=t[u];
	int mid=l+r>>1;
	if (ql<=mid) Query(ls[u],l,mid,ql);
		else Query(rs[u],mid+1,r,ql);
}

int main(){
	n=read();
	For(i,1,n) insert(rt,1,m,i);
	cout<<"!"<<endl;
	while (233){
		char op[10];
		scanf("%s",op);
		if (op[0]=='F') break;
		int x;
		scanf("%d",&x);
		ans=0,Query(rt,1,m,x);
		cout<<"! "<<ans-1<<endl;
	}
}