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

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

int func(vector<int> S, vector<int> T) {
    for (int x : T) S.push_back(x);
    int n = S.size();
    vector<int> f(n);
    for (int i = 1; i < n; i++) {
        int j = f[i - 1];
        while (j && S[j] != S[i]) j = f[j - 1];
        if (S[j] == S[i]) f[i] = j + 1;
    }
    return n / 2 - f[n - 1];
}
int main() {
    int s; cin >> s; 
    int cnt = 0, sz = 0;
    while (!sz || cnt < 50) {
        int f = rd(0);
        if (f) {
            A.push_back(s);
            B.push_back(s);
        }
        else {
            A.push_back(s);
            B.push_back(!s);
            cout << "? flip" << endl;
            cin >> s;
            ++cnt;
        }
        if (A.size() >= 6 && A.size() % 2 == 0) {
            int x = func(B, A);
            ans[x]++;
            ++sz;
        }
        cout << "? right" << endl;
        cin >> s;
        ++cnt;
    }
    int res = max_element(ans + 3, ans + 5050) - ans;
    cout << "! " <<  res << endl;
    
}