/*

Author: Haze

2024/4/24

*/

#include <bits/stdc++.h>

#define irep(i, l, r) for(int i = (l); i <= (r); ++ i)
#define drep(i, r, l) for(int i = (r); i >= (l); -- i)
#define IOS ios::sync_with_stdio(false), cin.tie(nullptr);
using namespace std;
typedef long long ll;

inline ll read() {
    ll s = 0;
    bool fl = false;
    char ch = (char) getchar();
    while (!isdigit(ch)) {
        if (ch == '-')fl = true;
        ch = (char) getchar();
    }
    while (isdigit(ch)) {
        s = s * 10 + (ch ^ 48);
        ch = (char) getchar();
    }
    return fl ? -s : s;
}

const int mod = 1000000000 + 7;
const int itinf = 1000000999;
const ll llinf = 2e18;
const int N = 500099;
int n;
bool ok = 0;
int query(int l, int r){
//    if(l == r)return true;
//    if(r == n)return false;
    cout << "? " << l << ' ' << r << endl;
    string S;
    cin >> S;
    if(r == n && S == "present")ok = 1;
    if(S == "absent")return true;
    return false;
}
int f[N], a[N];
void solve() {
//    int n;
    cin >> n;
    int l = 0, r = 1, ans = 0;
    vector<int>arr;
    int cur = 0;
    while(l < n){
        r = l + 1;
        while(r <= n && query(l, r) == false){
            ++ r, ++ cur;
        }
        if(cur == 0)arr.push_back(1);
        else arr.push_back(2);
        cur = 0;
        l = r;
    }
    int m = arr.size();
    irep(i, 1, m){
        a[i] = arr[i - 1];
//        cerr << a[i] << endl;
    }
    /*
    irep(i, 2, m){
        if(a[i - 1] == 1){
            f[i] = f[i - 2] + 1;
        }
        else f[i] = f[i - 1] + 1;
    }
     */
    cout << "! " << m - ok << endl;
}

int main() {
    // IOS
    int T = 1;
    while (T--) {
        solve();
    }
    return 0;
}
/*
 6
 present
 present
 absent
 absent
 present
 present

present
 present
 absent
 present
 absent
 absent

 */