#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

#define ll long long
#define ld long double
//#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)
int inf=1000000007;
ll infl=1000000000000000007;
ll mod=1000000007;
ll mod1=998244353;

const int N=107;

int g[N][N];

int ask(int a,int b,int c)
{
	cout<<"? "<<a<<" "<<b<<" "<<c<<endl;
	int x;
	cin>>x;
	return x;
	//return g[a][b]+g[b][c]+g[a][c];
}

int c[N][N];

void Set(int a,int b,int x)
{
	c[a][b]=x;
	c[b][a]=x;
}



signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    srand(2137);
    int n=100;
    FOR(i,1,n)
    {
		FOR(j,i+1,n)
		{
			g[i][j]=rand()%2;
			g[j][i]=g[i][j];
		}
	}
    int A,B,C;
    while(true)
    {
		A=rand()%n+1,B=rand()%n+1,C=rand()%n+1;
		while(B==A) B=rand()%n+1;
		while(C==A||C==B) C=rand()%n+1;
		int t=ask(A,B,C);
		if(t==3)
		{
			Set(A,B,1);
			Set(B,C,1);
			Set(C,A,1);
			break;
		}
		if(t==0) break;
	}
	debug(A,B,C);
	vector<int>V={A,B,C},W;
	FOR(i,1,n) if(i!=A&&i!=B&&i!=C) W.pb(i);
	random_shuffle(all(W));
	for(auto i:W)
	{
		random_shuffle(all(V));
		vector<int>act;
		int T;
		for(auto j:V)
		{
			if(sz(act)==0) act.pb(j);
			else
			{
				int t=ask(i,act.back(),j)-c[act.back()][j];
				if(t!=1)
				{
					int val=(t==2);
					Set(i,j,val);
					reverse(all(act));
					FOR(l,0,sz(act)-1) Set(i,act[l],val^(l%2));
					act.clear();
					T=j;
				}
				else act.pb(j);
			}
		}
		if(sz(act)>2)
		{
			int val=(ask(i,act[0],act[2])-c[act[0]][act[2]])==2;
			if(ask(i,act[0],act[2])-c[act[0]][act[2]]) val=1;
			FOR(l,0,sz(act)-1) Set(i,act[l],val^(l%2));
		}
		else for(auto l:act) Set(i,l,ask(i,l,T)-c[l][T]-c[i][T]);
		V.pb(i);
	}
	cout<<"!"<<endl;
	FOR(i,1,n) 
	{
		FOR(j,1,n) cout<<c[i][j];
		cout<<endl;
		/*FOR(j,1,n) cout<<g[i][j];
		cout<<endl;
		cout<<endl;*/
	}
	/*bool ans=1;
	FOR(i,1,n) 
	{
		FOR(j,1,n) if(c[i][j]!=g[i][j]) ans=0;
	}
	if(ans==0) cout<<"WA"<<endl;*/
    return 0;
}