/**
 *      Author:  Nicholas Winschel
 *      Created: 11.11.2024 22:16:13
**/

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using db=long double;
template<class T> using V=vector<T>;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int,int>;
#define f first
#define s second
#define sz(x) (int)((x).size())
#define each(a,b) for (auto &a : b)

int main() {
  cin.tie(0)->sync_with_stdio(0); // initialize fast I/O

  int n; cin >> n;
  vi rb(n), dp(n);
  for (int i = 0; i < n; i++) {
    if (i) rb[i] = rb[i-1];
    if (rb[i] < i) rb[i]=i;
    while (1) {
      if (rb[i] == n) break;
      cout << "? " << i << " " << rb[i]+1 << endl;
      string s; cin >> s;
      if (s == "absent") break;
      rb[i]++;
    }
  }
  for (int i = n-1; i >= 0; --i) {
    if (i < n-1) dp[i] = dp[i+1];
    if (rb[i] < n) {
      dp[i] = max(dp[i], 1+((rb[i]<n-1)?dp[rb[i]+1]:0));
    }
  }
  cout << "! " << dp[0] << "\n";

  return 0;
}