#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
 
mt19937 rng((int) chrono::steady_clock::now().time_since_epoch().count());
    
const int maxn = 110;

const int MOD = 1e9 + 7;
const int MAXN = 2e5 + 5;
const ll INF = 1e18 - 10;

int n;

string text;

string s[maxn];
string ans[maxn];

int main() 
{
    cin >> n;

    for(int i = 0 ; i < n ; i++)
        cin >> s[i];

    for(int d = 0 ; d < 2*n - 1 ; d++)
    {
        vector<pii> cells;

        for(int i = 0 ; i < n ; i++)
            if( d - i >= 0 && d - i < n ) cells.push_back( { i , d - i } );

        if( d%2 == 0 )
            reverse( cells.begin() , cells.end() );

        for(auto [x, y]: cells)
            text += s[x][y];
    }

    int p = 0;

    for(int i = 0 ; i < n ; i++)
        ans[i].resize(n);

    for(int step = 0 ; step < n/2 ; step++)
    {
        for(int x = step ; x < n - step ; x++)
            ans[step][x] = text[p++];

        for(int x = step + 1 ; x < n - step ; x++)
            ans[x][n - step - 1] = text[p++];

        for(int x = n - step - 2 ; x >= step ; x--)
            ans[n - step - 1][x] = text[p++];

        for(int x = n - step - 2 ; x > step ; x--)
            ans[x][step] = text[p++];

    }

    if( n & 1 )
        ans[n/2][n/2] = text[p++];

    for(int i = 0 ; i < n ; i++)
        cout << ans[i] << endl;
}