#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
#define piii tuple<int,int,int>
#define mp make_pair
#define mt make_tuple
#define x first
#define y second
#define fi first
#define se second
#define ins insert
#define it iterator
#define lb lower_bound
#define ub upper_bound
#define exc(exp) if(exp)continue;
#define ret(exp) if(exp)return;
#define stop(exp) if(exp)break;
#define quit(sth) {sth;return;}
#define let(var...) int var;tie(var)
#define siz(vec) ((int)((vec).size()))
#define all(vec) (vec).begin(),(vec).end()
#define unq(vec) sort(all(vec)),(vec).erase(unique(all(vec)),(vec).end())
#define deb(var) cerr<<#var<<'='<<(var)<<"; "
#define debl(var) cerr<<#var<<'='<<(var)<<";\n"
#define db double
#define ll long long
#define int long long
#define inf (long long)(1e18)
mt19937 gen(random_device{}());
bool Max(int &x,int y){if(x<y)return x=y,1;return 0;}
bool Min(int &x,int y){if(x>y)return x=y,1;return 0;}
const int mod=1e9+7;
void Add(int &x,int y){x=x+y<mod?x+y:x+y-mod;}
int add(int x,int y){return x+y<mod?x+y:x+y-mod;}
int fpm(int x,int y){
	int ans=1;for(;y;y>>=1,(x*=x)%=mod)if(y&1)(ans*=x)%=mod;return ans;
}

int n=100,G[110][110],H[110][110];
int vis[110][110][110];
int ask(int a,int b,int c){
    if(vis[a][b][c])return vis[a][b][c]-1;
    cout<<"? "<<a<<' '<<b<<' '<<c<<endl;
    cin>>vis[a][b][c];vis[a][b][c]++;return vis[a][b][c]-1;
}
int ask(int a,int b,int c,int d){
    return (ask(a,b,d)+ask(a,b,c)-ask(c,a,d)-ask(c,b,d))/2;
}
void answ(int G[110][110]){
    cout<<"! "<<endl;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++)cout<<G[i][j];cout<<endl;
    }
}
void chk(){
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(G[i][j]<0||G[i][j]>1)return answ(H);
            if(H[i][j]<0||H[i][j]>1)return answ(G);
        }
    }
    while(1){
        int u=gen()%n+1,v,w;
        do v=gen()%n+1;while(u==v);
        do w=gen()%n+1;while(u==w||v==w);
        int s=ask(u,v,w);
        if(G[u][v]+G[v][w]+G[w][u]!=s)return answ(H);
        if(H[u][v]+H[v][w]+H[w][u]!=s)return answ(G);
    }               answ(G);
}
void work(){
    H[1][2]=H[2][1]=1;
    for(int i=3;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            int s=ask(i,j,1,2);
            G[i][j]=G[j][i]=G[1][2]+s;
            H[i][j]=H[j][i]=H[1][2]+s;
        }
    }
    for(int i=3;i<=n;i++){
        int u=99,v=100;
        if(i==99)u=98;
        if(i==100)v=98;
        int s=ask(1,i,u,v);
        G[1][i]=G[i][1]=G[u][v]+s;
        H[1][i]=H[i][1]=H[u][v]+s;
            s=ask(2,i,u,v);
        G[2][i]=G[i][2]=G[u][v]+s;
        H[2][i]=H[i][2]=H[u][v]+s;
    }                           chk();
}
signed main(){
	int T=1;while(T--)work();
}
/*
 * CONTINUE, NON-STOPPING, FOR THE FAITH
 * START TYPING IF YOU DON'T KNOW WHAT TO DO
 * STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING
 */