//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
using u32=unsigned;
const int s=256,b=16,c=16;
const u32 test_key=998244353u;
inline u32 query(u32 x)
{
	u32 y;
	printf("? %08x\n",x);
	fflush(stdout);
	scanf("%x",&y);
	return y;
}
#ifndef ONLINE_JUDGE
#define query(x) transform(x,test_key)
#endif
inline u32 Xor(u32 in,u32 key){return in^key;}
inline u32 Perm(u32 in)
{
	const static u32 p[16]={7,0,5,6,11,15,4,3,1,13,12,14,8,9,10,2};
	u32 out=0;
	for(int i=0;i<8;i++)
		out|=(p[in>>(i<<2)&15])<<(i<<2);
	return out;
}
inline u32 Mix(u32 in)
{
	function<u32(u32)> t=[&](u32 x){return ((x&7)<<1)^((x>>3&1)*3);};
	u32 out=0;
	for(int i=0;i<8;i++)
	{
		int i2=(i>>1)|((i&1)<<2);
		out|=((in>>(i2<<2)&15)^(t(in>>((i2^1)<<2)&15)))<<(i<<2);
	}
	return out;
}
inline u32 transform(u32 in,u32 key)
{
	function<u32(u32)> bundle=[&](u32 in){return Mix(Perm(Xor(in,key)));};
	in=bundle(in);
	in=bundle(in);
	in=bundle(in);
	in=bundle(in);
	in=bundle(in);
	in=bundle(in);
	return Xor(in,key);
}
namespace builtin_rmix_solver
{
	u32 v1[16][16],v2[16][16];
	void init()
	{
		function<u32(u32)> t=[&](u32 x){return ((x&7)<<1)^((x>>3&1)*3);};
		for(u32 in1=0;in1<16;in1++)
			for(u32 in2=0;in2<16;in2++)
			{
				v1[in1^t(in2)][in2^t(in1)]=in1;
				v2[in1^t(in2)][in2^t(in1)]=in2;
			}
	}
}
inline void rmix_solve(u32 out1,u32 out2,u32 &in1,u32 &in2)
{
	in1=builtin_rmix_solver::v1[out1][out2];
	in2=builtin_rmix_solver::v2[out1][out2];
}
inline u32 rMix(u32 out)
{
	u32 outb[8];
	for(int i=0;i<8;i++)
		outb[i]=(out>>(i<<2)&15);
	u32 inb[8];
	rmix_solve(outb[0],outb[2],inb[0],inb[1]);
	rmix_solve(outb[4],outb[6],inb[2],inb[3]);
	rmix_solve(outb[1],outb[3],inb[4],inb[5]);
	rmix_solve(outb[5],outb[7],inb[6],inb[7]);
	u32 in=0;
	for(int i=0;i<8;i++)
		in|=(inb[i])<<(i<<2);
	assert(Mix(in)==out);
	return in;
}
inline u32 rPerm(u32 out)
{
	const static u32 p[16]={7,0,5,6,11,15,4,3,1,13,12,14,8,9,10,2};
	u32 ip[16];
	for(int i=0;i<16;i++) ip[p[i]]=i;
	u32 in=0;
	for(int i=0;i<8;i++)
		in|=(ip[out>>(i<<2)&15])<<(i<<2);
	assert(Perm(in)==out);
	return in;
}
mt19937_64 rng(time(0));
struct block
{
	vector<u32> in,out;
};
struct group
{
	vector<u32> in,out;
	void init()
	{
		in.resize(s);
		out.resize(s);
		u32 val=(rng()>>40)<<8;
		for(int i=0;i<s;i++)
		{
			in[i]=val|i;
			out[i]=query(in[i]);
		}
	}
	vector<block> gen(u32 key8)
	{
		vector<block> ret(b);
		for(int i=0;i<s;i++)
		{
			u32 val=Mix(Perm(Xor(in[i],key8)));
			ret[val>>8&15].in.pb(in[i]);
			ret[val>>8&15].out.pb(out[i]);
		}
		for(int i=0;i<b;i++)
			assert(sz(ret[i].in)==b);
		return ret;
	}
};
vector<u32> check8(int o1,int o2,int i1,int i2,vector<block> vb)
{
	vector<u32> ret;
	for(u32 k1=0;k1<(1<<4);k1++)
		for(u32 k2=0;k2<(1<<4);k2++)
		{
			u32 key=(k1<<(o1<<2))|(k2<<(o2<<2));
			int flag=1;
			for(auto b:vb)
			{
				u32 x1=0,x2=0;
				for(auto out:b.out)
				{
					out=Xor(out,key);
					out=rMix(out);
					out=rPerm(out);
					x1^=(out>>(i1<<2)&15);
					x2^=(out>>(i2<<2)&15);
				}
				if(x1||x2)
				{
					flag=0;
					break;
				}
			}
			if(flag) ret.pb(k1|(k2<<4));
		}
	return ret;
}
vector<u32> check32(vector<u32> cand,group g)
{
	vector<u32> ret;
	for(auto key:cand)
	{
		int flag=1;
		for(int i=0;i<s;i++)
			if(transform(g.in[i],key)!=g.out[i])
			{
				flag=0;
				break;
			}
		if(flag) ret.pb(key);
	}
	return ret;
}
vector<u32> check32(vector<u32> cand,vector<group> vg)
{
	for(auto gr:vg) cand=check32(cand,gr);
	return cand;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	builtin_rmix_solver::init();
	vector<group> vg(c);
	for(int i=0;i<c;i++) vg[i].init();
	vector<u32> keys;
	for(u32 key8=0;key8<(1<<8);key8++)
	{
		vector<block> vb;
		for(auto gr:vg)
		{
			vector<block> tmp=gr.gen(key8);
			for(auto bl:tmp) vb.pb(bl);
		}
		vector<u32> cand[4];
		cand[0]=check8(0,2,0,1,vb);
		cand[1]=check8(4,6,2,3,vb);
		cand[2]=check8(1,3,4,5,vb);
		cand[3]=check8(5,7,6,7,vb);
		for(auto V0:cand[0])
		for(auto V1:cand[1])
		for(auto V2:cand[2])
		for(auto V3:cand[3])
		{
			u32 key=0;
			key|=(V0&15)<<0;
			key|=(V0>>4)<<8;
			key|=(V1&15)<<16;
			key|=(V1>>4)<<24;
			key|=(V2&15)<<4;
			key|=(V2>>4)<<12;
			key|=(V3&15)<<20;
			key|=(V3>>4)<<28;
			if((key&255)==key8)
				keys.pb(key);
		}
	}
	keys=check32(keys,vg);
	assert(sz(keys)==1);
	printf("! %u\n",keys[0]);
	fflush(stdout);
	return 0;
}