#include <bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()

int main() {
    int n;
    cin >> n;
    vector<string> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    string ord;
    for (int i = 0; i < 2 * n; ++i) {
        string tmp;
        for (int j = 0; j <= i; ++j) {
            if (0 <= i - j && i - j < n && j < n) {
                tmp.push_back(a[j][i - j]);
            }
        }
        if (i % 2 == 0) {
            reverse(all(tmp));
        }
        ord += tmp;
    }
    // cout << ord << endl;
    assert(ord.size() == n * n);
    vector<string> ans(n, string(n, 'x'));
    for (int ptr = 0, i = 0; 2 * i < n; ++i) {
        for (int j = i; j < n - 1 - i; ++j) {
            ans[i][j] = ord[ptr++];
        }
        for (int j = i; j < n - 1 - i; ++j) {
            ans[j][n - 1 - i] = ord[ptr++];
        }

        for (int j = i; j < n - 1 - i; ++j) {
            ans[n - 1 - i][n - 1 - j] = ord[ptr++];
        }
        for (int j = i; j < n - 1 - i; ++j) {
            ans[n - 1 - j][i] = ord[ptr++];
        }
    }
    if (n & 1) {
        ans[n / 2][n / 2] = ord.back();
    }
    for (int i = 0; i < n; ++i) {
        cout << ans[i] << '\n';
    }
}