#include <bits/stdc++.h>
typedef long long int ll;
#define pb             push_back
#define mp              make_pair
#define pll             pair<ll,ll> 
#define fill(x, y)     memset(x, y, sizeof(x))
#define all(x)         (x).begin(), (x).end()
#define debug(x)       { cerr << #x << " = " << x << endl; }
#define IO	       { ios_base::sync_with_stdio(false); cin.tie(0); }
#define read(x)	       freopen(x, "r", stdin)
#define write(x)       freopen(x, "w", stdout)


using namespace std;

mt19937 mt(time(nullptr)); 


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

const int N = 64;
bitset<N> org;
bitset<N> cur_seq;


void solve() {
    int cur;
    cin >> cur;

    
    bool flag = true;
    
    right();
    cin >> cur;
    if (cur != 0) {
        flip();
        cin >> cur;
    }
    for (int i=0; i<80; i++) {
        right();
        cin >> cur;
        if (cur != 1) {
            flip();
            cin >> cur;
        }
        
    }
    
    bool allOne = true;
    for (int i=0; i<100; i++) {
        left();
        cin >> cur;
        if (cur != 1) allOne = false;
    }

    // ofstream fout("debug.txt");

    if (allOne) {
        // length <= N
        flip();
        cin >> cur;
        int i = 1;
        while(1) {
            right();
            cin >> cur;
            if (cur == 0) break;
            i++;
        }
        cout <<"! "<< i<< endl;
    } else {
        // length > N
        for(int i=0;i<N;i++){
            org[i]=mt()%2;
        }

        //cout << org.to_string() << endl;
        // fout << org.to_string() << endl;
        // for (int i=0; i<N; i++) {
        //     fout << org[i];
        // }
        // fout << endl;

        for(int i=0; i<N; i++) {
            right();
            cin >> cur;
            //cout << cur << " " << org[i] << " " << (cur == org[i]) << endl;
            if (cur != org[i]) {
                flip();
                cin >> cur;
            }
            // fout << cur;
        }
        // fout << endl;

        cur_seq = org;
        int idx = 1;

        // int cnt = 200;

        while(1) {
            right();
            cin >> cur;
            // fout << cur;
            unsigned long long x = cur;
            cur_seq >>= 1;
            cur_seq |= (x << (N-1));

            //cout << " -> " << cur_seq.to_string() << endl;

            if ( (cur_seq ^ org).count() == 0 ) break;
            idx++;
        } 
        cout <<"! "<< idx << endl;


    }
}

int main() {
    
    //cout << fixed << setprecision(10);
    solve();
}