#include <bits/stdc++.h>
using namespace std;
#define int long long
int mx[] = {0, 1, 0, -1};
int my[] = {1, 0, -1, 0};
void Solve()
{
    int n;
    cin >> n;
    vector<string> s(n + 1);
    vector<string> res(n + 1);
    for (int i = 1; i <= n; i++)
    {
        cin >> s[i];
        s[i] = ' ' + s[i];
        res[i].assign(n + 1, '0');
    }
    string ans;
    for (int i = 2; i <= n + n; i++)
    {
        if (i % 2 == 0)
        {
            for (int j = i - 1; j >= 1; j--)
            {
                if (j > n || i - j > n)
                    continue;
                ans += s[j][i - j];
            }
        }
        else
        {
            for (int j = 1; j < i; j++)
            {
                if (j > n || i - j > n)
                    continue;
                ans += s[j][i - j];
            }
        }
    }
    // cout << ans << endl;
    int x = 1, y = 1;
    int op = 0;
    vector<vector<int>> vis(n + 1, vector<int>(n + 1));
    res[1][1] = ans[0];
    vis[1][1] = 1;
    for (int i = 1; i < n * n; i++)
    {
        int nx = x + mx[op];
        int ny = y + my[op];
        if (nx < 1 || ny < 1 || nx > n || ny > n || vis[nx][ny])
        {
            op = (op + 1) % 4;
            nx = x + mx[op];
            ny = y + my[op];
        }
        x = nx, y = ny;
        vis[x][y] = 1;
        res[x][y] = ans[i];
        // cout << x << " " << y << endl;
        // cout << ans[i] << endl;
    }
    // cout << "bug" << endl;
    // cout << res[1][1] << endl;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            cout << res[i][j];
        }
        cout << endl;
    }
}
signed main()
{
    Solve();
}