#include <bits/stdc++.h>
using namespace std;
#define int long long

void QAQ() {
    int n;
    cin >> n;

    vector<string> a(n);
    for (auto & x : a) {
        cin >> x;
    }

    vector<pair<int, int>> D = {{0, 1}, {1, -1}, {1, 0}, {-1, 1}};

    string t;

    t += a[0][0];
    t += a[0][1];

    for (int i = 0, j = 1; ; ) {
        int fl = 0;
        for ( ; ; ) {
            i += D[1].first, j += D[1].second;
            t += a[i][j];
            if (t.size() >= n * n) {
                fl = 1;
                break;
            }
            if (i == n - 1) {
                i += D[0].first, j += D[0].second;
                t += a[i][j];
                if (t.size() >= n * n) {
                    fl = 1;
                    break;
                }
                if (i < 0 || j < 0 || i >= n || j >= n) fl = 1;
                break;
            } else if (j == 0) {
                i += D[2].first, j += D[2].second;
                t += a[i][j];
                if (t.size() >= n * n) {
                    fl = 1;
                    break;
                }
                if (i < 0 || j < 0 || i >= n || j >= n) fl = 1;
                break;
            }
        }
        if (fl) break;
        for ( ; ; ) {
            i += D[3].first, j += D[3].second;
            t += a[i][j];
            if (t.size() >= n * n) {
                fl = 1;
                break;
            }
            if (j == n - 1) {
                i += D[2].first, j += D[2].second;
                t += a[i][j];
                if (t.size() >= n * n) {
                    fl = 1;
                    break;
                }
                if (i < 0 || j < 0 || i >= n || j >= n) fl = 1;
                break;
            } else if (i == 0) {
                i += D[0].first, j += D[0].second;
                t += a[i][j];
                if (t.size() >= n * n) {
                    fl = 1;
                    break;
                }
                if (i < 0 || j < 0 || i >= n || j >= n) fl = 1;
                break;
            }
        }
        if (fl) break;
    }

    D = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};

    vector ans(n, vector<char>(n, ' '));
    for (int i = 0, j = 0, idx = 0, op = 0; idx < t.size(); idx++) {
        ans[i][j] = t[idx];
        if (idx + 1 == t.size()) break;
        auto [dx, dy] = D[op];
        int ti = dx + i, tj = dy + j;
        while (ti < 0 || tj < 0 || ti >= n || tj >= n || ans[ti][tj] != ' ') {
            (op += 1) %= 4;
            tie(dx, dy) = D[op];
            ti = dx + i, tj = dy + j;
        }
        i += dx, j += dy;
    }

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

signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    int t = 1;
    // cin >> t;

    while (t--) {
        QAQ();
    }
}