#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define EPS 1e-9
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define yes cout << "YES" << '\n';
#define no cout << "NO" << '\n';
#define mem(arrr, xx) memset(arrr,xx,sizeof arrr)
#define PI acos(-1)
#define Ones(n) __builtin_popcount(n)
#define Onesl(n) __builtin_popcountll(n)
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
const ll MOD = 1e9 + 7;
const ll N = 2e5 + 5;
const int OO = 0x3f3f3f3f;
const ll LOO = 0x3f3f3f3f3f3f3f3f;
int dx8[] = {+0, +0, -1, +1, +1, +1, -1, -1};
int dy8[] = {-1, +1, +0, +0, +1, -1, +1, -1};
int dx4[] = {+0, +0, -1, +1};
int dy4[] = {-1, +1, +0, +0};

void Fast() {
    cin.tie(nullptr), cout.tie(nullptr), cin.sync_with_stdio(false), cout.sync_with_stdio(false);
#ifdef Clion
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int ask(const string &s){
    cout << "? " << s << endl;
    int ret;
    cin >> ret;
    return ret;
}
void Solution() {
    int x;
    cin >> x;
    vector<int> values;
    for (int i = 0; i < 100; ++i) {
        values.push_back(x);
        int cur = rng() % 2;
        if(ask("right") != cur) ask("flip");
        x = cur;
    }
    bool ok = false;
    for (int i = 0; i < 100; ++i) {
        int cur = ask("left");
        if(cur != values.back()) ok = true;
        values.pop_back();
        x = cur;
    }
    if(ok){
        for (int i = 0; i < 100; ++i) {
            if(x)ask("flip");
            x = ask("right");
        }
        ask("flip");
        int n = 1;
        while (true){
            if(ask("right")){
                cout << "! " << n << endl;
                return;
            }
            n++;
        }
    }
    else{
        deque<int> taken, nw;
        for (int i = 0; i < 100; ++i) {
            taken.push_back(x);
            x = ask("right");
        }
        int n = 1;
        while (true){
            nw.push_back(x);
            x = ask("right");
            if(nw.size() > 100) nw.pop_front();
            if(nw == taken){
                cout << "! " << n << endl;
                return;
            }
            n++;
        }
    }
}

int main() {
    Fast();
    int T = 1;
//    cin >> T;
    while (T--) {
        Solution();
    }
}