#include<bits/stdc++.h>
using namespace std;
const int N = 100;
int E[N+114][N+114];
int del[N+14][N+14];
int vis[N+14][N+14];
int A,B,C;
#define id(u,v) ((u-1)*N+v-1)
mt19937 rd(time(0));
vector<int> to[N*N+N+114514];
int ask(int a,int b,int c){
    if(a==b) assert(0);
    int ans;
    if(vis[a][b]==1&&vis[a][c]==1&&vis[b][c]==1){
        ans=E[a][b]+E[a][c]+E[b][c];
    }else{
        cout<<"?"<<' '<<a<<' '<<b<<' '<<c<<endl;
        cin>>ans;
    }
    return ans-del[a][b]*E[a][b]-del[b][c]*E[b][c]-del[a][c]*E[a][c];
}
void expand(int now){
    for(int v:to[now]){
        E[v%N+1][v/N+1]=E[v/N+1][v%N+1]=E[now/N+1][now%N+1]^1;
        vis[v%N+1][v/N+1]=vis[v/N+1][v%N+1]=1;
        expand(v);
    }
    to[now].clear();
}
void solve(int u,vector<int> P){
    if(P.size()==0) return ;
    if(P.size()==1){
        E[u][P[0]]=E[P[0]][u]=ask(A,u,P[0]);
        vis[u][P[0]]=vis[P[0]][u]=1;
        expand(id(u,P[0]));
        return ;
    }
    shuffle(P.begin(),P.end(),rd);
    vector<int> Q;
    if(P.size()%2==1) Q.push_back(P.back()),P.pop_back();
    for(int i=0;i<P.size();i+=2){
        int c=ask(u,P[i],P[i+1]);
        if(c==2){
            E[u][P[i]]=E[P[i]][u]=E[u][P[i+1]]=E[P[i+1]][u]=1;
            expand(id(u,P[i]));
            expand(id(u,P[i+1]));
        }else if(c==0){
            E[u][P[i]]=E[P[i]][u]=E[u][P[i+1]]=E[P[i+1]][u]=0;
            expand(id(u,P[i]));
            expand(id(u,P[i+1]));
        }else{
            to[id(u,P[i])].push_back(id(u,P[i+1]));
            Q.push_back(P[i]);
        }
    }
    solve(u,Q);
}
int flag;
vector<int> s;
void dfs(int h,int lst){
    if(h>3){
        cout<<"?"<<' '<<A<<' '<<B<<' '<<C<<endl;
        int ans;
        cin>>ans;
        if(ans==0){
            flag=1;
        }else if(ans==3){
            flag=2;
        }
        return ;
    }
    for(int i=lst+1;i<=6;i++){
        if(h==1){
            A=s[i-1];
            dfs(h+1,i);
            if(flag!=0) return ;
            A=0;
        }else if(h==2){
            B=s[i-1];
            dfs(h+1,i);
            if(flag!=0) return ;
            B=0;
        }else{
            C=s[i-1];
            dfs(h+1,i);
            if(flag!=0) return ;
            C=0;
        }
    }
}
vector<int> op;
int main(){
    set<int> S;
    while(S.size()<6){
        S.insert(rd()%N+1);
    }
    for(int x:S) s.push_back(x);
    dfs(1,0);
    if(rd()%2) swap(A,B);
    if(rd()%2) swap(B,C);
    if(flag==2) E[A][B]=E[B][A]=E[A][C]=E[C][A]=E[B][C]=E[C][B]=1;
    else E[A][B]=E[B][A]=E[A][C]=E[C][A]=E[B][C]=E[C][B]=0;
    vis[A][B]=vis[B][A]=vis[A][C]=vis[C][A]=vis[B][C]=vis[C][B]=1;
    del[A][B]=del[B][A]=1;
    del[A][C]=del[C][A]=1;
    for(int i=1;i<=N;i++) op.push_back(i);
    shuffle(op.begin(),op.end(),rd);
    for(int i:op){
        if(i!=A&&i!=B&&i!=C){
            if(rd()%2) swap(B,C);
            int f=B;
            int c=ask(A,f,i);
            if(c==2){
                E[i][A]=E[A][i]=E[i][f]=E[f][i]=1;
                int b=ask(A,C,i);
                E[i][C]=E[C][i]=b-E[A][i];
            }else if(c==0){
                E[i][A]=E[A][i]=E[i][f]=E[f][i]=0;
                int b=ask(A,C,i);
                E[i][C]=E[C][i]=b-E[A][i];
            }else{
                int g=C;
                int b=ask(A,g,i);
                if(b==2){
                    E[i][A]=E[A][i]=E[i][g]=E[g][i]=1;
                    E[i][f]=E[f][i]=0;

                }else if(b==0){
                    E[i][A]=E[A][i]=E[i][g]=E[g][i]=0;
                    E[i][f]=E[f][i]=1;
                }else{
                    int a=ask(f,g,i)-E[f][g];
                    E[i][A]=E[A][i]=(a+b+c)/2-a;
                    E[i][f]=E[f][i]=(a+b+c)/2-b;
                    E[i][g]=E[g][i]=(a+b+c)/2-c;
                }
            }
            del[i][A]=del[A][i]=1;
            vis[i][A]=vis[A][i]=vis[i][B]=vis[B][i]=vis[i][C]=vis[C][i]=1;
        }
    }
    vector<int> P;
    for(int i=1;i<=N;i++){
        if(i!=A&&i!=B&&i!=C){
            solve(i,P);
            for(int x:P) vis[i][x]=vis[x][i]=true,del[i][x]=del[x][i]=true;
            P.push_back(i);
        }
    }
    cout<<"!"<<endl;
    for(int i=1;i<=N;i++){
        for(int j=1;j<=N;j++) cout<<E[i][j];
        cout<<endl;
    }
    return 0;
}