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

//#define DEBUG

#ifdef DEBUG
int hideN=0;
int hidePos=0;
int hideA[100050];
int moveCNT=0;
void prepare(){
	mt19937 rng((unsigned long long)(new char));
	hideN=rng()%(5000-3+1)+3;
//	hideN=5000;
	hidePos=rng()%hideN;
	for (int i=0;i<hideN;i++) hideA[i]=rng()%2;
}
#endif

const int lim=50;
int pos=0;
int a[100050];
int b[100050];
int patt[100050];

int move(int tp){
	string str;
	if (tp==0) str="? left";
	else if (tp==1) str="? right";
	else str="? flip";
	cout << str << endl;
	
	int ret=0;
	#ifdef DEBUG
		++moveCNT;
		if (moveCNT>3*hideN+500){
			cerr << "fuck" << endl;
			exit(0);
		}
		if (tp==0) hidePos=(hidePos+1)%hideN;
		else if (tp==1) hidePos=(hidePos+hideN-1)%hideN;
		else hideA[hidePos]^=1;
		ret=hideA[hidePos];
	#else
		cin >> ret;
	#endif
	
	if (tp==0) pos--;
	else if (tp==1) pos++;
	
	a[pos]=ret;
	
	return ret;
}
void answer(int ansN){
	cout << "! " << ansN << endl;
	#ifdef DEBUG
		assert(ansN==hideN);
	#endif
	exit(0);
}

int main(){
//	freopen("G.out","w",stdout);
//	freopen("G.err","w",stderr);
	#ifdef DEBUG
		prepare();
	//	cerr << hideN << " " << hidePos << endl;
	#endif
	mt19937 rng(58);
	for (int i=0;i<lim;i++) patt[i]=rng()%2;
	
	#ifdef DEBUG
		a[0]=hideA[hidePos];
	#else
		cin >> a[0];
	#endif
	if (a[0]!=patt[0]) move(2);
	for (int i=1;i<lim;i++){
		move(1);
		if (a[pos]!=patt[pos]) move(2);	
	}
	
	for (int i=lim;i<lim+lim;i++){
		move(1);
		assert(pos==i);
	}
	for (int i=0;i<lim+lim;i++) b[i]=a[i];
	
	for (int cnt=lim;cnt>=1;cnt--) move(0);
	move(2);
	for (int i=lim;i<lim+lim;i++) move(1);
	{
		for (int n=3;n<=lim;n++){
			bool flag=1;
			for (int j=0;j<n;j++){
				if (a[lim-n+j]!=a[lim+j] || b[lim-n+j]!=b[lim+j]){
					flag=0;
					break;
				}
			}
			if (flag) answer(n);
		}
	}
	for (;;){
		bool flag=1;
		for (int i=0;i<lim;i++) if (a[pos-i]!=a[lim-1-i]) flag=0;
		if (flag){
			answer(pos+1-lim);
		}
		move(1);
	}
	return 0;
}