//Author: Kevin5307
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb push_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);}
int cnt[6][6];
int val[6][6];
int edge[110][110];
int qry(int a,int b,int c)
{
	cout<<"? "<<a<<" "<<b<<" "<<c<<endl;
	int x;
	cin>>x;
	return x;
}
int val2[110];
int main()
{
	for(int i=1;i<=5;i++)
		for(int j=i+1;j<=5;j++)
		{
			cout<<"?";
			for(int x=1;x<=5;x++)
				if(i!=x&&j!=x)
					cout<<" "<<x;
			cout<<endl;
			int v;
			cin>>v;
			val[i][j]=v;
		}
	for(int i=0;i<(1<<10);i++)
	{
		memset(cnt,0,sizeof(cnt));
		int x=0;
		for(int j=1;j<=5;j++)
			for(int k=j+1;k<=5;k++)
			{
				if(i>>x&1)
				{
					for(int j1=1;j1<=5;j1++)
						for(int k1=j1+1;k1<=5;k1++)
							if(j1!=j&&j1!=k&&k1!=j&&k1!=k)
								cnt[j1][k1]++;
				}
				x++;
			}
		bool flag=1;
		for(int a=1;a<=5;a++)
			for(int b=a+1;b<=5;b++)
				if(cnt[a][b]!=val[a][b])
					flag=0;
		if(flag)
		{
			x=0;
			for(int j=1;j<=5;j++)
				for(int k=j+1;k<=5;k++)
					edge[j][k]=edge[k][j]=(i>>(x++)&1);
			break;
		}
	}
	for(int i=6;i<=100;i++)
	{
		for(int j=0;j==0;j+=3)
		{
			int c1=qry(j+1,j+2,i)-edge[j+1][j+2];
			int c2=qry(j+2,j+3,i)-edge[j+2][j+3];
			int c3=qry(j+3,j+1,i)-edge[j+3][j+1];
			int sm=(c1+c2+c3)/2;
			edge[j+1][i]=edge[i][j+1]=sm-c2;
			edge[j+2][i]=edge[i][j+2]=sm-c3;
			edge[j+3][i]=edge[i][j+3]=sm-c1;
		}
		for(int j=4;j+1<i;j+=2)
		{
			int v=qry(j,j+1,i)-edge[j][j+1];
			if(!v)
				edge[j][i]=edge[i][j]=edge[j+1][i]=edge[i][j+1]=0;
			else if(v==2)
				edge[j][i]=edge[i][j]=edge[j+1][i]=edge[i][j+1]=1;
			else
			{
				int v2=qry(1,j,i)-edge[1][j]-edge[1][i];
				edge[j][i]=edge[i][j]=v2;
				edge[j+1][i]=edge[i][j+1]=v-v2;
			}
		}
		if(i%2)
		{
			int j=i-1;
			edge[j][i]=edge[i][j]=qry(1,j,i)-edge[1][i]-edge[1][j];
		}
	}
	cout<<"!";
	for(int i=1;i<=100;i++)
	{
		cout<<"\n";
		for(int j=1;j<=100;j++)
			cout<<edge[i][j];
	}
	cout<<endl;
	return 0;
}