#include <bits/stdc++.h>

constexpr int MAXN = 119;
int n;
std::string a[MAXN];
std::vector<char> res;

constexpr int D = 4, DX[D] = {0, 1, 0, -1}, DY[D] = {1, 0, -1, 0};

int main() {
    std::cin >> n;
    for (int i = 0; i < n; ++i) {
        std::cin >> a[i];
    }

    bool rev = false;
    for (int i = 0; i < n; ++i) {
        std::vector<char> tmp;
        for (int j = 0; j <= i; ++j) {
            tmp.push_back(a[i - j][j]);
        }
        if (rev) std::reverse(tmp.begin(), tmp.end());
        rev = !rev;

        res.insert(res.end(), tmp.begin(), tmp.end());
    }
    for (int i = n - 2; i >= 0; --i) {
        std::vector<char> tmp;
        for (int j = 0; j <= i; ++j) {
            tmp.push_back(a[n - 1 - j][n - 1 - i + j]);
        }
        if (rev) std::reverse(tmp.begin(), tmp.end());
        rev = !rev;

        res.insert(res.end(), tmp.begin(), tmp.end());
    }
    
    std::vector<std::vector<char>> ans(n, std::vector<char>(n, 0));
    auto check = [&](int x, int y) {
        return x >= 0 && x < n && y >= 0 && y < n && !ans[x][y];
    };

    int x = 0, y = 0, p = 0;
    for (int i = 0; i < n * n; ++i) {
        ans[x][y] = res[i];

        if (i != n * n - 1) {
            if (!check(x + DX[p], y + DY[p])) {
                p = (p + 1) % D;
            }
            x += DX[p];
            y += DY[p];
        }
    }

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