#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

vector<int> ask;
vector<int> cand[256];
vector<int> V;
void dfs(int mask) {
	if(V.size()==4) {
		set<vector<int>> S;
		FOR(mask,64) {
			vector<int> C;
			FORR(v,V) {
				int a=v^mask^63;
				C.push_back(__builtin_popcount(a));
			}
			int mi=111;
			FORR(c,C) mi=min(mi,c);
			FORR(c,C) c-=mi;
			if(S.count(C)) return;
			cand[mask]=C;
			S.insert(C);
		}
		ask=V;
		cout<<"!"<<endl;
		return;
	}
	if(mask>=64||ask.size()) return;
	
	V.push_back(mask);
	dfs(mask+1);
	V.pop_back();
	dfs(mask+1);
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	dfs(0);
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}