#include <bits/stdc++.h>

using std::cin;
using std::cout;
using std::endl;
using std::vector;
using std::string;
using ll = long long;
using vi = vector<ll>;
using vii = vector<vi>;
using pii = std::pair<ll,ll>;

#define ln "\n"
#define pb emplace_back
#define mp std::make_pair
#define mtp std::make_tuple
#define rep(i,j,k) for(ll i=ll(j); i<ll(k); i++)
#define REP(i,j,k) for(ll i=ll(j); i<=ll(k); i++)
#define per(i,j,k) for(ll i=ll(j); i>=ll(k); i--)
#define all(a) a.begin(),a.end()

constexpr ll inf = (1ll<<60);
constexpr ll mod = 1e9+7;
constexpr ll mul = 23;

void dec(std::map<ll,ll> &mem, ll el){
    mem[el]--;
    if(mem[el] == 0) mem.erase(el);
}

int main(){
    cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    std::random_device rnd;
    std::mt19937_64 mt(rnd());
    constexpr ll V = 100;
    vii ans(V+1, vi(V+1));
    {
        vector<vii> mem(6,vii(6,vi(6)));
        REP(i,1,5){
            REP(j,i+1,5){
                REP(k,j+1,5){
                    cout << "? " << i << " " << j << " " << k << endl;
                    cin >> mem[i][j][k];
                }
            }
        }
        ll edge = 10;
        ll ch = 0;
        rep(bit,0,1<<edge){
            ll cnt = 0;
            vii table(6,vi(6));
            REP(i,1,5){
                REP(j,i+1,5){
                    if(bit & (1<<cnt)){
                        table[i][j] = true;
                    }
                    cnt++;
                }
            }
            bool flag = true;
            REP(i,1,5){
                REP(j,i+1,5){
                    REP(k,j+1,5){
                        if(mem[i][j][k] != table[i][j]+table[j][k]+table[i][k]) flag = false;
                    }
                }
            }
            if(flag){
                ch++;
                REP(i,1,6){
                    REP(j,i+1,6){
                        ans[i][j] = ans[j][i] = table[i][j];
                    }
                }
            }
        }
        assert(ch == 1);
    }
    REP(k,6,V){
        vi p(k-1);
        rep(i,0,k-1) p[i] = i+1;
        //std::shuffle(all(p), mt);
        ll last = 0;
        rep(i,1,k-1){
            cout << "? " << p[i-1] << " " << p[i] << " " << k << endl;
            ll res; cin >> res;
            res -= ans[p[i-1]][p[i]];
            if(res == 1) continue;
            if(res == 0){
                ans[p[i-1]][k] = ans[k][p[i-1]] = ans[p[i]][k] = ans[k][p[i]] = 0;
            }
            else{
                ans[p[i-1]][k] = ans[k][p[i-1]] = ans[p[i]][k] = ans[k][p[i]] = 1;
            }
            per(j,i-2,last){
                ans[p[j]][k] = ans[k][p[j]] = 1-ans[p[j+1]][k];
            }
            last = i+1;
            i++;
        }
        if(last == k-1) continue;
        if(last == 0){
            cout << "? " << p[0] << " " << p[2] << " " << k << endl;
            ll res; cin >> res;
            res /= 2;
            ans[p[0]][k] = ans[k][p[0]] = res;
            rep(i,1,k-1) ans[p[i]][k] = ans[k][p[i]] = 1-ans[p[i-1]][k];
        }
        else{
            cout << "? " << p[0] << " " << p[k-2] << " " << k << endl;
            ll res; cin >> res;
            res -= ans[p[0]][p[k-2]];
            res -= ans[p[0]][k];
            ans[p[k-2]][k] = ans[k][p[k-2]] = res;
            per(j,k-3,last){
                ans[p[j]][k] = ans[k][p[j]] = 1-ans[p[j+1]][k];
            }
        }
    }
    cout << "!" << endl;
    REP(i,1,V){
        REP(j,1,V) cout << ans[i][j];
        cout << endl;
    }
}