#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

#define el '\n'
#define FIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
typedef unsigned long long ull;

template<typename T, typename X>
using hashTable = gp_hash_table<T, X>;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

// mt19937_64 for long long
mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());

void doWork()
{
    int flipped;
    cin >> flipped;
    int n = 0;
    int lst = 0;
    int op = 0;
    for(int i = 1; i < min(n * 3, 9) + 501; ++i)
    {
        if(lst == flipped && i > 1)
        {
            cout << "? flip" << endl;
            cin >> lst;
            op++;
        }
        else
        {
            int mnwr;
            cout << "? left" << endl;
            cin >> mnwr;
            if(mnwr == flipped)
            {
                n = i - op;
            }
            else if(n == 0)
                n = i;
            lst = mnwr;
        }
    }
    cout << "! " << n << endl;
}

signed main()
{
    FIO
    int T = 1;
//    cin >> T;
    for(int i = 1; i <= T; i++)
        doWork();
}