#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

bool ask(int i, int j) {
	cout << "? " << i << " " << j << endl;
	string res;
	cin >> res;
	return res == "present";
} 

int main()
{
	//ios::sync_with_stdio(false);
	//cin.tie(0);	
	int n;
	cin >> n;
	vector<int> f(n);
	int ptr = 0;
	FOR(i, 0, n) {
		ptr = max(ptr, i + 1);
		while (ptr <= n && ask(i, ptr)) {
			ptr++;
		}
		f[i] = ptr;
	}
	vector<int> dp(n + 1);
	dp[n] = 0;
	RFOR(i, n, 0) {
		dp[i] = dp[i + 1];
		if (f[i] <= n) {
			dp[i] = max(dp[i], dp[f[i]] + 1);
		}
	}
	cout << "! " << dp[0] << endl;
	return 0;
}