#include<bits/stdc++.h>
using namespace std;
const int MAXN = 10005;

mt19937 Rand(time(0));

int p[MAXN], s[MAXN];

int nn, a[MAXN], pos;

void init() {
    nn = 5000;
    for (int i = 1; i <= nn; ++i) {
        a[i] = Rand() % 2;
    }
    pos = 1;
}

void output(int type) {
    if (type == 1) {
        //a[pos] ^= 1;
        printf("? flip\n");
    } else {
        //++pos; if (pos > nn) pos = 1;
        printf("? right\n");
    }
    fflush(stdout);
}

int input() {
    int ret;
    scanf("%d", &ret);
    //ret = a[pos];
    return ret;
}

void solve() {
    for (int i = 1; i <= 250; ++i) {
        p[i] = Rand() % 2;
    }
    for (int i = 1; i <= 250; ++i) {
        s[i] = input();
        if (s[i] != p[i]) {
            output(1);
            input();
        }
        output(2);
    }
    puts("");
    for (int n = 3; n <= 125; ++n) {
        bool ok = 1;
        for (int i = n + 1; i <= 250; ++i) {
            if (s[i] != p[i - n]) {
                ok = 0;
                break;
            }
        }
        if (ok) {
            input();
            printf("! %d\n", n);
            fflush(stdout);
            return;
        }
    }
    for (int i = 251; ; ++i) {
        s[i] = input();
        if (i >= 376) {
            bool ok = 1;
            for (int j = 250, k = i; j >= 126; --j, --k) {
                if (p[j] != s[k]) {
                    ok = 0;
                    break;
                }
            }
            if (ok) {
                printf("! %d\n", i - 250);
                fflush(stdout);
                return;
            }
        }
        output(2);
    }
}

int main() {
    //init();
    solve();
    return 0;
}