#include <bits/stdc++.h>
//#include "trokuti.h"
using namespace std;
const int N=103,n=100;
mt19937 rng(2007329);
int read(){
	char c=getchar();int x=0;
	while(c<48||c>57) c=getchar();
	do x=(x<<1)+(x<<3)+(c^48),c=getchar();
	while(c>=48&&c<=57);
	return x;
}
int ask(int a,int b,int c){
	printf("? %d %d %d\n",a,b,c);
	fflush(stdout);return read();
}
void report(bool f[N][N]){
	puts("!");
	for(int i=1;i<=n;++i){
		for(int j=1;j<=n;++j)
			putchar(f[i][j]^48);
		putchar('\n');
	}
	fflush(stdout);
	exit(0);
}
int p[N];
int x;
bool tmp[5][5];
int cur[10];
bool f[N][N];
void op(int x,int y,bool t){f[p[x]][p[y]]=f[p[y]][p[x]]=t;}
int main(){
	iota(p,p+n,1);
	shuffle(p,p+n,rng);
	for(int s=0,tt=0;s<(1<<5);++s)
		if(__builtin_popcount(s)==3u){
			int a=__builtin_ctz(s);
			int b=__builtin_ctz(s^(1<<a));
			int c=__builtin_ctz(s^(1<<a)^(1<<b));
			cur[tt++]=ask(p[a],p[b],p[c]);
		}
	for(int s=0;s<(1<<10);++s){
		int rk=0;
		for(int i=0;i<5;++i)
			for(int j=i+1;j<5;++j)
				tmp[j][i]=tmp[i][j]=s>>rk++&1;
		bool fl=1;
		for(int s=0,tt=0;s<(1<<5);++s)
			if(__builtin_popcount(s)==3u){
				int a=__builtin_ctz(s);
				int b=__builtin_ctz(s^(1<<a));
				int c=__builtin_ctz(s^(1<<a)^(1<<b));
				int rr=tmp[a][b]+tmp[b][c]+tmp[a][c];
				if(rr!=cur[tt++]){fl=0;break;}
			}
		if(fl){
			for(int i=0;i<5;++i)
				for(int j=i+1;j<5;++j) op(i,j,tmp[i][j]);
			break;
		}
	}
	for(int i=5;i<n;++i){
		shuffle(p,p+i,rng);
		int pos=0;
		while(pos<i){
			int a=0,b=0;
			if(pos<i) a=pos++;
			if(pos<i) b=pos++;
			int t=ask(p[a],p[b],p[i])-f[p[a]][p[b]];
			if(!t){op(i,a,0);op(i,b,0);continue;}
			if(t==2){op(i,a,1);op(i,b,1);continue;}
			int c=0;
			if(pos<i) c=pos++;
			int qa=ask(p[a],p[c],p[i])-f[p[a]][p[c]];
			if(!qa){op(i,a,0);op(i,b,1);op(i,c,0);continue;}
			if(qa==2){op(i,a,1);op(i,b,0);op(i,c,1);continue;}
			int qb=ask(p[b],p[c],p[i])-f[p[b]][p[c]];
			if(!qb){op(i,a,1);op(i,b,0);op(i,c,0);continue;}
			if(qb==2){op(i,a,0);op(i,b,1);op(i,c,1);continue;}
		}
	}
	report(f);
}