#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
typedef long double D;
typedef long long LL;
bool debug = false;
mt19937 gene(3);
const int N = 5555;
int _s[N], _n, pos;
const int L = 250;
int read() {
	if(debug) {
		return _s[pos];
	}else {
		int res;
		cin >> res;
		return res;
	}
}
int flip() {
	if(debug) {
		return (_s[pos] ^= 1);
	} else {
		cout << "? flip" << endl;
		int res;
		cin >> res;
		return res;
	}
}
void go_right() {
	if(debug) {
		pos = (pos + 1) % _n;
	}else {
		cout << "? right" << endl;
	}
}
void answer(int len) {
	if(debug) {
		assert(len == _n);
		cout << "correct:" << len << ' ' << _n << endl;
	}else {
		cout << "! " << len << endl;
	}
	exit(0);
}
int main() {
	vector<int> pat;
	for(int i = 0; i < L; i++) {
		pat.pb(gene() % 2);
	}

	vector<int> vec;
	if(debug) {
		_n = 1001;//gene() % 4998 + 3;
		for(int i = 0; i < _n; i++) {
			_s[i] = gene() % 2;
		}
		pos = gene() % _n;
	}

	for(;;) {
		int x = read();
		vec.push_back(x);
		if(vec.size() >= pat.size()) {
			bool eq = true;
			for(int i = 0; i < (int)pat.size(); i++) {
				if(pat[i] != vec[(int)vec.size() - (int)pat.size() + i]) {
					eq = false;
				}
			}
			if(eq) {
				answer(vec.size() - pat.size());
			}
		}
		if(vec.size() <= pat.size()) {
			int id = vec.size() - 1;
			if(vec[id] != pat[id]) {
				int res = flip();
				assert(res == pat[id]);
			}
		}
		go_right();
	}
}