#include<iostream>
#include<cstdio>
#include<random>
#include<ctime>
#include<cstdlib>
#include<map>
#include<algorithm>
#include<cassert>
#define N 100
#define M 10
using namespace std;
mt19937 RAND(time(0));
int length,length2,rt,E[N+1][N+1],ES[N+1][N+1],st[N+1];
struct reads
{
    int a[M+1];
    bool operator < (const reads &t)const
    {
	for (int i=1;i<=9;++i)
	    if (a[i]!=t.a[i])
		return a[i]<t.a[i];
	return 0;
    }
};
map<reads,reads>P;
reads x,y;
int F(int x,int y,int z)
{
    return E[x][y]+E[y][z]+E[x][z];
}
int query(int x,int y,int z)
{
    int d;
    cout<<'?'<<' '<<x<<' '<<y<<' '<<z<<endl;
    fflush(stdout);
    cin>>d;
    return d;
}
void solve(vector<int>p,int x)
{
    if (p.empty()) return;
    vector<int>delta(p.size());
    vector<int>q;
    bool op=1;
    while (!rt||op)
    {
	shuffle(p.begin(),p.end(),RAND),op=0;
	for (int i=0;i+1<p.size();i+=2)
	{
	    delta[i]=query(p[i],p[i+1],x)-ES[p[i]][p[i+1]];
	    if (!delta[i]) rt=p[i],ES[p[i]][x]=ES[x][p[i]]=ES[p[i+1]][x]=ES[x][p[i+1]]=0;
	    else if (delta[i]==1) q.push_back(p[i]);
	    else rt=p[i],ES[p[i]][x]=ES[x][p[i]]=ES[p[i+1]][x]=ES[x][p[i+1]]=1;
	}
    }
    if (p.size()&1) ES[p.back()][x]=ES[x][p.back()]=query(p.back(),rt,x)-ES[p.back()][rt]-ES[rt][x];
    solve(q,x);
    for (int i=0;i+1<p.size();i+=2)
	if (delta[i]==1)
	    ES[p[i+1]][x]=ES[x][p[i+1]]=(!ES[p[i]][x]);
    return;
}
int main()
{
    int cnt,d;
    vector<int>p;
    for (int i=0;i<(1<<10);++i)
    {
	cnt=length=length2=0;
	for (int j=1;j<=5;++j)
	    for (int k=j+1;k<=5;++k)
		E[j][k]=(i>>cnt)&1,cnt++;
	for (int j=1;j<=2;++j)
	    for (int k=j+1;k<=5;++k)
		for (int t=k+1;t<=5;++t)
		    x.a[++length]=F(j,k,t);
	for (int j=1;j<=5;++j)
	    for (int k=j+1;k<=5;++k)
		y.a[++length2]=E[j][k];
	P[x]=y;
    }
    length=length2=0;
    for (int i=1;i<=2;++i)
	for (int j=i+1;j<=5;++j)
	    for (int k=j+1;k<=5;++k)
		x.a[++length]=query(i,j,k);
    y=P[x];
    for (int i=1;i<=5;++i)
	for (int j=i+1;j<=5;++j)
	    ES[i][j]=ES[j][i]=y.a[++length2];
    for (int i=6;i<=100;++i)
    {
	p.clear(),rt=0;
	for (int j=1;j<=i-1;++j) p.push_back(j);
	solve(p,i);
    }
    cout<<'!'<<endl;
    for (int i=1;i<=100;++i)
    {
	for (int j=1;j<=100;++j) cout<<ES[i][j];
	cout<<endl;
    }
    fflush(stdout);
    return 0;
}