#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 100 + 5;

mt19937 gen(114514);

int ask(int x,int y,int z)
{
	printf("? %d %d %d\n",x,y,z);
	fflush(stdout);
	int res;
	scanf("%d",&res);
	return res;
}

int n;
int ans[MAXN][MAXN];
array<int,3> rt = {0,0,0};

void updans(int u,int v,int w)
{
	ans[u][v] = ans[v][u] = w;
}

int ask(int u,int v)
{
	if(ans[u][v] != -1) return ans[u][v];
	int k = ask(u, v, rt[0]) - ans[u][rt[0]] - ans[v][rt[0]];
	updans(u, v, k);
	return k;
}

int main(void)
{
	n = 100;
	
	memset(ans, -1, sizeof(ans));
	for(int i=1; i<=n; ++i)
		ans[i][i] = 0;
	
	vector<int> id(n);
	iota(id.begin(), id.end(), 1);
	shuffle(id.begin(), id.end(), gen);
	
	[&] (void)
	{
		for(int i=0; i<n; ++i)
		for(int j=0; j<i; ++j)
		for(int k=0; k<j; ++k)
		{
			int t = ask(id[i], id[j], id[k]);
			if(t == 0 || t == 3)
			{
				int cur = t / 3;
				updans(id[i], id[j], cur);
				updans(id[i], id[k], cur);
				updans(id[j], id[k], cur);
				rt = {id[i], id[j], id[k]};
				return;
			}
		}
	}();
	
	for(auto t: rt)
		id.erase(find(id.begin(), id.end(), t));
	
	for(auto t: id)
	{
		int x01 = ask(t, rt[0], rt[1]) - ans[rt[0]][rt[1]];
		int x02 = ask(t, rt[0], rt[2]) - ans[rt[0]][rt[2]];
		int x12 = ask(t, rt[1], rt[2]) - ans[rt[1]][rt[2]];
		
		[&] (void)
		{
			for(int i=0; i<=1; ++i)
			for(int j=0; j<=1; ++j) if(i + j == x01)
			for(int k=0; k<=1; ++k) if(i + k == x02 && j + k == x12)
			{
				updans(t, rt[0], i);
				updans(t, rt[1], j);
				updans(t, rt[2], k);
				return;
			}
		}();
	}
	
	while(id.size() >= 2)
	{
		int u = id.back(); id.pop_back();
		int v = id.back(); id.pop_back();
		ask(u, v);
		
		for(int w: id)
		{
			int k = ask(u, v, w) - ans[u][v];
			if(k == 0 || k == 2)
			{
				updans(u, w, k / 2);
				updans(v, w, k / 2);
				continue;
			}
			
			int kk = ask(u, w);
			updans(u, w, kk);
			updans(v, w, k - kk);
		}
	}
	
	for(auto u: id)
		for(auto v: id) if(u < v)
			ask(u, v);
	
	printf("!\n");
	for(int i=1; i<=n; ++i, printf("\n"))
		for(int j=1; j<=n; ++j)
			printf("%d",ans[i][j]);
	return 0;
}