#include<bits/stdc++.h>
#define file(F) freopen(#F".in","r",stdin),freopen(#F".out","w",stdout)
#define lowbit(x) ((x)&-(x))
#define ALL(x) (x).begin(),(x).end()
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define popc(x) (__builtin_popcountll((x)))
#define abs(x) ((x)>=0?(x):-(x))
using namespace std;
using ll=long long;
using uint=uint32_t;
namespace asnown {
using i32=int32_t; using u32=uint32_t;
using i64=int64_t; using u64=uint64_t;
using i128=__int128_t; using u128=__uint128_t; };
template<typename T>
inline bool Max(T &x,T y) { return std::less<T>()(x,y)&&(x=y,true); }
template<typename T>
inline bool Min(T &x,T y) { return std::less<T>()(y,x)&&(x=y,true); }
void Solve();
const int N = 1e5+15;
namespace SGT {
inline bool cmp(int p,int q,int x) {
   if(!p||!q) return bool(p);
   printf("? %d %d %d\n",p-1,q-1,x); fflush(stdout);
   string res; cin>>res;
   return res=="FIRST";
}
const int N = ::N<<2;
#define mid ((L+R)>>1)
#define ls (u<<1)
#define rs (ls|1)
int d[N];
void update(int u,int L,int R,int k) {
   if(cmp(k,d[u],mid)) swap(k,d[u]);
   if(L==R) return ;
   if(cmp(k,d[u],L)) update(ls,L,mid,k);
   if(cmp(k,d[u],R)) update(rs,mid+1,R,k);
}
int query(int u,int L,int R,int x) {
   if(L==R) return d[u];
   int p=(x<=mid?query(ls,L,mid,x):query(rs,mid+1,R,x));
   return cmp(d[u],p,x)?d[u]:p;
}
#undef mid
#undef ls
#undef rs
}
signed main() {
#ifndef ONLINE_JUDGE
#endif
   cin.tie(nullptr)->sync_with_stdio(false);
   Solve();
}
void Solve() {
   int n; cin>>n;
   for(int i=1;i<=n;i++) SGT::update(1,1,1e5,i);
   puts("!"); fflush(stdout);
   while(true) {
      string op; cin>>op;
      if(op=="FINISH") break;
      int w; cin>>w;
      printf("! %d\n",SGT::query(1,1,1e5,w)-1); fflush(stdout);
   }
}