#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 ask_all(int u,int v,int w)
{
	int t = ask(u, v, w);
	if(t == 0 || t == 3)
	{
		t /= 3;
		updans(u, v, t);
		updans(u, w, t);
		updans(v, w, t);
		return ans[u][v] + ans[u][w] + ans[v][w];
	}
	
	t = t - ask(u, v);
	if(t == 0 || t == 2)
	{
		t /= 2;
		updans(u, w, t);
		updans(v, w, t);
		return ans[u][v] + ans[u][w] + ans[v][w];
	}
	
	t = t - ask(u, w);
	updans(v, w, t);
	return ans[u][v] + ans[u][w] + ans[v][w];
}

void check(int u,int v,int w,int oth)
{
	int x01 = ask(u, v, oth) - ans[u][v];
	if(x01 == 0 || x01 == 2)
	{
		updans(u, oth, x01 / 2);
		updans(v, oth, x01 / 2);
		
		int x02 = ask(u, w, oth) - ans[u][w];
		updans(w, oth, x02 - ans[u][oth]);
		return;
	}
	
	int x02 = ask(u, w, oth) - ans[u][w];
	if(x02 == 0 || x02 == 2)
	{
		updans(u, oth, x02 / 2);
		updans(w, oth, x02 / 2);
		updans(v, oth, x01 - ans[oth][u]);
		return;
	}
	
	int x12 = ask(v, w, oth) - ans[v][w];
	updans(v, oth, x12 / 2);
	updans(w, oth, x12 / 2);
	updans(u, oth, x01 - ans[oth][v]);
}

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)
	{
		check(rt[0], rt[1], rt[2], t);
	}
	
	vector<int> has;
	for(auto u: id)
	{
		vector<int> vec;
		
		int i = 0;
		shuffle(has.begin(), has.end(), gen);
		for(; i+1 < (int)has.size(); i+=2)
		{
			int v = has[i], w = has[i+1];
			int t = ask(u, v, w) - ans[v][w];
			if(t == 0 || t == 2)
			{
				updans(u, v, t / 2);
				updans(u, w, t / 2);
				continue;
			}
			
			if(vec.size() == 0)
			{
				vec.emplace_back(v);
				vec.emplace_back(w);
				continue;
			}
			
			t = ask(u, v, vec[0]) - ans[v][vec[0]];
			if(t == 0 || t == 2)
			{
				t /= 2;
				updans(u, v, t);
				updans(u, w, t ^ 1);
				
				for(int j=0; j<(int)vec.size(); ++j)
					updans(u, vec[j], t ^ (j & 1));
				vec.clear();
			}
			else
			{
				vec.insert(vec.begin(), v);
				vec.insert(vec.begin(), w);
			}
		}
		if(i < (int)has.size())
			ask(u, has[i]);
		
		if(vec.size())
		{
			int t = ask(u, vec[0]);
			for(int j=0; j<(int)vec.size(); ++j)
				updans(u, vec[j], t ^ (j & 1));
		}
		
		has.emplace_back(u);
	}
	
	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;
}