#include <deque>
#include <iostream>
#include <random>
bool s;
void in() { std::cin >> s; }
void left() { std::cout << "? left" << std::endl, in(); }
void right() { std::cout << "? right" << std::endl, in(); }
void flip() { std::cout << "? flip" << std::endl, in(); }
#define OUT(ans) \
do\
{\
	std::cout << "! " << (ans) << std::endl;\
	return 0;\
}\
while (0)
constexpr int M = 100;
bool a[M + 1];
bool b[M];
int main()
{
	in();
	a[0] = s;
	for (int i = 1; i <= M; ++i)
	{
		right();
		a[i] = s;
	}
	flip();
	for (int i = M; ~--i; )
	{
		left();
		if (a[i] != s)
			OUT(M - i);
	}
	// n > M
	std::mt19937 gen{std::random_device()()};
	std::uniform_int_distribution rd(0, 1);
	for (int i = 0; i < M; ++i)
		b[i] = rd(gen);
	if (a[0] != b[0])
		flip();
	for (int i = 1; i < M; ++i)
	{
		right();
		if (a[i] != b[i])
			flip();
	}
	std::deque<int> c;
	for (int i = M; i < 2 * M; ++i)
	{
		right();
		c.push_back(s);
	}
	int i = M;
	do
	{
		++i;
		right();
		c.pop_front(), c.push_back(s);
		if ([&c]() {
			for (int i = 0; i < M; ++i)
				if (b[i] != c[i])
					return false;
			return true;
		}())
			OUT(i);
	}
	while (true);
}