#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const int N = 100 + 3;

int n;
string s[N];

bool valid(int x, int y){
    return 0 <= x && x <= n - 1 && 0 <= y && y <= n - 1;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

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

    string poem = "";
    for(int d = 0; d < 2 * n - 1; ++d){
        int x, y;
        if(d % 2 == 0){
            if(d < n){
                x = d, y = 0;
            }
            else{
                x = n - 1;
                y = d - (n - 1);
            }
            for(; valid(x, y); --x, ++y){
                poem += s[x][y];
            }
        }
        else{
            if(d < n){
                x = 0, y = d;
            }
            else{
                x = d - (n - 1);
                y = n - 1;
            }
            for(; valid(x, y); --y, ++x){
                poem += s[x][y];
            }
        }
    }

    // cout << poem << " poem" << endl;

    int cnt = 0;
    for(int i = 0; i <= n - i - 1; ++i){
        if(i == n - i - 1){
            s[i][i] = poem[cnt++];
            break;
        }

        for(int y = i; y <= n - i - 1; ++y)
            s[i][y] = poem[cnt++];
        for(int x = i + 1; x <= n - i - 1; ++x)
            s[x][n - i - 1] = poem[cnt++];
        for(int y = n - i - 2; y >= i; --y)
            s[n - i - 1][y] = poem[cnt++];
        for(int x = n - i - 2; x >= i + 1; --x)
            s[x][i] = poem[cnt++];
    }
    // cout << cnt << " cnt" << endl;
    // cout << poem.size() << " poem" << endl;

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