#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
template<class T1,class T2> bool cmin(T1 &x,const T2 &y) { if (y<x) { x=y; return 1; }return 0; }
template<class T1,class T2> bool cmax(T1 &x,const T2 &y) { if (x<y) { x=y; return 1; }return 0; }
#define all(x) (x).begin(),(x).end()
mt19937 rnd(235);
int main()
{
	ios::sync_with_stdio(0); cin.tie(0);
	cout<<fixed<<setprecision(15);
	int s=0,t=200;
	vector<int> lst(30),f(t),g(t);
	int n=30,i,j,N=5000,k;
	cin>>s;
	int p=0;
	vector<int> a(N);
	for (int &x:a) x=rnd()&1;
#ifdef LOCAL
	s=a[0];
#endif
	auto ask=[&](int op)
		{
			if (op==0)
			{
				cout<<"? left"<<endl;
#ifdef LOCAL
				p=(p+N-1)%N;
#endif
			}
			else if (op==1)
			{
				cout<<"? right"<<endl;
#ifdef LOCAL
				p=(p+N+1)%N;
#endif
			}
			else
			{
				cout<<"? flip"<<endl;
#ifdef LOCAL
				a[p]^=1;
#endif
			}
#ifdef LOCAL
			return a[p];
#endif
			int x;
			cin>>x;
			return x;
		};
	auto answer=[&](int x)
		{
			cout<<"! "<<x<<endl;
#ifdef LOCAL
			assert(x==N);
#endif
		};
	vector<int> pos(31,1);
	pos[0]=1;
	f[0]=s;
	g[0]=rnd()&1;
	for (i=1; i<t; i++)
	{
		if (g[i-1]) ask(2);
		f[i]=ask(1);
		for (j=1; j<=30; j++)
			for (k=0; pos[j]&&k<j&&k+j<=i; k++)
				pos[j]&=(f[i-k]==f[i-k-j]^g[i-k-j]);
		g[i]=rnd()&1;
		// for (j=1; j<=30; j++) cerr<<pos[j]; cerr<<endl;
	}
	for (i=1; i<=30; i++) if (pos[i])
	{
		answer(i);
		return 0;
	}
	const int B=28;
	int S=rnd()&(1u<<B)-1;
	ll ls=0;
	for (i=0; i<B; i++)
	{
		int s=ask(1);
		if (s!=(S>>B-i-1&1)) ask(2);
	}
	for (i=0; i<B; i++)
	{
		int s=ask(1);
		ls=ls<<1|s;
	}
	for (i=B;; i++)
	{
		if (ls==S)
		{
			answer(i);
			return 0;
		}
		int s=ask(1);
		ls=(ls<<1|s)&(1<<B)-1;
	}
	assert(0);
}