#include <bits/stdc++.h>

using namespace std;
using ll = long long;

mt19937 rnd(228);

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n = 100;

#ifdef __APPLE__
    cin >> n;
#endif

    vector mp(n, vector(n, vector<int>(n, -1)));
    vector e(n, vector<int>(n, -1));

    for (int i = 0; i < n; ++i) {
        e[i][i] = 0;
    }

    auto ask = [&](array<int, 3> a) {
        sort(a.begin(), a.end());
        if (mp[a[0]][a[1]][a[2]] == -1) {
            cout << "? " << a[0] + 1 << " " << a[1] + 1 << " " << a[2] + 1 << endl;
            cin >> mp[a[0]][a[1]][a[2]];
            int x = mp[a[0]][a[1]][a[2]];
            if (x == 0 || x == 3) {
                for (int i = 0; i < 3; ++i) {
                    for (int j = i + 1; j < 3; ++j) {
                        e[i][j] = bool(x);
                    }
                }
            }
        }
        return mp[a[0]][a[1]][a[2]];
    };

    int qwq = 1;
    array<int, 3> t{};

    for (; qwq <= 1e4; ++qwq) {
        array<int, 3> a{};
        for (int i = 0; i < 3; ++i) {
            a[i] = rnd() % n;
            bool ok = true;
            for (int j = 0; j < i; ++j) {
                ok &= a[i] != a[j];
            }
            if (!ok) {
                i -= 1;
            }
        }
        if (int x = ask(a); x == 0 || x == 3) {
            t = a;
            for (int i = 0; i < 3; ++i) {
                for (int j = i + 1; j < 3; ++j) {
                    e[a[i]][a[j]] = e[a[j]][a[i]] = bool(x);
                }
            }
            break;
        }
    }

    for (int x = 0; x < n; ++x) {
        if (find(t.begin(), t.end(), x) != t.end()) {
            continue;
        }
        vector<pair<int, int>> o{{0, 1}, {0, 2}, {1, 2}};
//        shuffle(o.begin(), o.end(), rnd);
        for (auto [i, j] : o) {
            int c = ask({x, t[i], t[j]});
            if (c - e[t[i]][t[j]] == 0 || c - e[t[i]][t[j]] == 2) {
                e[t[i]][x] = e[t[j]][x] = e[x][t[i]] = e[x][t[j]] = c > e[t[i]][t[j]];
                int oth = t[3 ^ i ^ j];
                e[oth][x] = e[x][oth] = ask({x, t[i], oth}) - e[x][t[i]] - e[t[i]][oth];
                break;
            }
        }
    }

    for (int i = 0; i < n; ++i) {
        for (int j = i + 1; j < n; ++j) {
            if (e[i][j] == -1) {
                e[i][j] = e[j][i] = ask({i, j, t[0]}) - e[i][t[0]] - e[j][t[0]];
            }
        }
    }

    cout << "!\n";

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            cout << e[i][j];
        }
        cout << '\n';
    }

    return 0;
}