#include <bits/stdc++.h>

#define f first
#define s second
#define pb push_back
#define mp make_pair

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;

const int N = 300500, inf = 1e9, mod = 998244353;
const ll INF = 1e18;

int sum(int a, int b) {
    a += b;
    if (a >= mod)
        a -= mod;
    return a;
}

int sub(int a, int b) {
    a -= b;
    if (a < 0)
        a += mod;
    return a;
}

int mult(int a, int b) {
    return 1ll * a * b % mod;
}

int bp(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1)
            res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

int inv(int x) {
    return bp(x, mod - 2);
}


void gogo(int dir)
{
    if (dir==1) cout << "? " << "left" << endl;
    else cout << "? " << "right" << endl;
}

void flip()
{
    cout << "? flip" << endl;
}

void fin(int n)
{
    cout << "! " << n << endl;
    exit(0);
}

void solve() {
    vector<int> a;
    vector<int> F;
    mt19937 gen(time(0));
    uniform_int_distribution<ll> uid(0,mod);
    for (int i=0;;i++)
    {
        int x;
        cin >> x;
        a.push_back(x);
        F.push_back(x);
        if (uid(gen)%2==1)
        {
            flip();
            int x;
            cin >> x;
            F.back() ^= 1;
        }
        if (i>=30)
        {
            int P = (i-24)/2;
            int ok = 1;
            for (int j=0;j+P<a.size();j++)
            {
                if (F[j]!=a[j+P]) ok = 0;
            }
            if (ok==1) fin(P);
        }
        gogo(1);
    }

}

int main() {
//#ifdef DEBUG
//    freopen("input.txt", "r", stdin);
//#endif
    ios_base::sync_with_stdio(false);
    int t = 1;
//    cin >> t;
    for (int i = 1; i <= t; i++) {
//        cout << "Case #" << i << endl;
        solve();
    }
}