#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 1e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
#define fl fflush(stdout)
mt19937 rd(114514);
ll n=100,mp[6][6],cnt=0,q[11][3],tot=0,res[11],id[110];
bl E[110][110],e[110][110];
char s[110];
ll query(ll x,ll y,ll z){
	pf("? %lld %lld %lld\n",x,y,z);
	fl;
	x=read();
	return x;
}
int main(){
	fr(i,1,n) id[i]=i;
	shuffle(id+1,id+n+1,rd);
	fr(i,1,5) fr(j,i+1,5) mp[i][j]=mp[j][i]=cnt++;
	fr(i,1,5){
		fr(j,i+1,5){
			fr(k,j+1,5){
				q[++tot][0]=id[i];
				q[tot][1]=id[j];
				q[tot][2]=id[k];
				res[tot]=query(id[i],id[j],id[k]);
			}
		}
	}
	fr(x,0,(1ll<<cnt)-1){
		fr(i,1,5) fr(j,i+1,5) E[id[i]][id[j]]=E[id[j]][id[i]]=(x>>mp[i][j])&1;
		bl ck=0;
		fr(i,1,tot) if((E[q[i][0]][q[i][1]]+E[q[i][1]][q[i][2]]+E[q[i][2]][q[i][0]])!=res[i]) ck=1;
		if(ck) continue;
		break;
	}
	fr(i,6,n){
		shuffle(id+1,id+i,rd);
		ll lst=1;
		fr(j,2,i-1){
			ll tmp=query(id[i],id[j-1],id[j])-E[id[j-1]][id[j]];
			if(!tmp){
				E[id[i]][id[j-1]]=E[id[i]][id[j]]=E[id[j-1]][id[i]]=E[id[j]][id[i]]=0;
				pfr(k,j-2,lst) E[id[i]][id[k]]=E[id[k]][id[i]]=(j-k-1)&1;
				lst=j+1;
				j++;
			}
			else if(tmp==2){
				E[id[i]][id[j-1]]=E[id[i]][id[j]]=E[id[j-1]][id[i]]=E[id[j]][id[i]]=1;
				pfr(k,j-2,lst) E[id[i]][id[k]]=E[id[k]][id[i]]=(j-k)&1;
				lst=j+1;
				j++;
			}
		}
		if(lst<i){
			if(lst>1){
				ll tmp=query(id[i],id[i-1],id[1])-E[id[i]][id[1]]-E[id[i-1]][id[1]];
				pfr(j,i-1,lst) E[id[i]][id[j]]=E[id[j]][id[i]]=tmp^((i-j-1)&1);
			}
			else{
				ll tmp=(query(id[i],id[1],id[3])-E[id[1]][id[3]])/2;
				fr(j,lst,i-1) E[id[i]][id[j]]=E[id[j]][id[i]]=tmp^((j-lst)&1);
			}
		}
	}
	pf("!\n");
	fr(i,1,n){
		fr(j,1,n) write(E[i][j]);
		enter;
	}
	fl;
}