//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[5];
int val[5];
int edge[110][110];
int qry(int a,int b,int c)
{
	cout<<"? "<<a<<" "<<b<<" "<<c<<endl;
	int x;
	cin>>x;
	return x;
}
int main()
{
	for(int i=0;i<4;i++)
	{
		cout<<"? ";
		for(int j=0;j<4;j++)
			if(i!=j)
				cout<<j+1<<" ";
		cout<<endl;
		int x;
		cin>>x;
		val[i]=x;
	}
	for(int i=0;i<(1<<6);i++)
	{
		memset(cnt,0,sizeof(cnt));
		int x=0;
		for(int j=0;j<4;j++)
			for(int k=j+1;k<4;k++)
			{
				if(i>>x&1)
					for(int y=0;y<4;y++)
						if(y!=j&&y!=k)
							cnt[y]++;
				x++;
			}
		bool flag=1;
		for(int j=0;j<4;j++)
			if(cnt[j]!=val[j])
				flag=0;
		if(flag)
		{
			x=0;
			for(int j=0;j<4;j++)
				for(int k=j+1;k<4;k++)
				{
					if(i>>x&1)
						edge[j+1][k+1]=edge[k+1][j+1]=1;
					x++;
				}
		}
	}
	for(int i=5;i<=100;i++)
	{
		for(int j=0;j+3<i;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=(i-1)/3*3+1;j<i;j++)
			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;
}