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

vector<int> wrt, readd;
int get(){
    int r1= rand() & 1;
    int r2= rand() & 1;
    int r3= rand() & 1;
    return (r1 + r2 + r3) & 1;
}
int Flip(){
    cout<<"? flip\n"; cout.flush();
    int x; cin>>x;
    return x;
}
int Right(){
    cout<<"? right\n"; cout.flush();
    int x; cin>>x;
    return x;
}
int Left(){
    cout<<"? left\n"; cout.flush();
    int x; cin>>x;
    return x;
}

void out(int n){
    cout<<"! "<<n; cout.flush();
    exit(0);
}
int main() {
    cin.tie(0);cin.sync_with_stdio(0);
    cout.tie(0);cout.sync_with_stdio(0);

    int cur;
    cin>>cur;

    int qs = 500;
    while(qs > 1)
    {
        readd.push_back(cur);
        int put= get();
        if(put != cur){
            assert(Flip() == put);
            qs--;
        }
        wrt.push_back(put);
        cur= Right();
        qs--;
    }
    int p = 0;
    for(int i = 3; i < readd.size(); i++){
        int n = i;
        if(readd.size() >= 2 * n){
            bool valid = 1;
            for(int j = 0, k = i; k < readd.size(); k++, j++){
                if(readd[k] != wrt[j]){
                    valid= 0;
                    break;
                }
            }
            if(valid)
            {
                out(n);
            }
            p= i + 1;
        }else break;
    }

    int ops = 3 * 5000 + 10;
    while(ops--)
    {
        readd.push_back(cur);
        int put= get();
        if(put != cur){
            assert(Flip() == put);
            qs--;
        }
        wrt.push_back(put);
        cur= Right();

        while(readd.size() >= 2 * p)
        {
            int n = p;
            bool valid = 1;
            for(int j = 0, k = p; k < readd.size(); k++, j++){
                if(readd[k] != wrt[j]){
                    valid= 0;
                    break;
                }
            }
            if(valid)
            {
                out(n);
            }
            p++;
        }
    }
}