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

mt19937 rnd(15'571'557);
int rd() {
    return uniform_int_distribution<int>(0, 1)(rnd);
}
int ans[5050], fail[101010];
vector<int> A, B;

int str[5050], pt = 0, t = 5000;
int main() {
    int s; cin >> s;
    int cnt = 0, p = 0, q = 0, limit = 490;
    while (cnt < limit) {
        int f = rd();
        if (f) {
            A.push_back(s);
            B.push_back(s);
        }
        else {
            A.push_back(s);
            B.push_back(!s);
            cout << "? flip" << endl;
            cin >> s;
        }
        int n = A.size();

        if (n >= 2) {
            while (p && B[n - 1] != B[p]) p = fail[p - 1];
            if (B[n - 1] == B[p]) fail[n - 1] = ++p;

            while (q && B[q] != A[n - 1]) q = fail[q - 1];
            if (B[q] == A[n - 1]) ++q;
        }
        
        if (A.size() >= 100 && A.size() % 2 == 0) {
            int x = n - q;
            limit = 490 + 3 * x;
        }
        cout << "? right" << endl;
        cin >> s;
    }
    cout << "! " << (limit - 490) / 3 << endl;
}