#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;


int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    int n;
    cin >> n;
    vector<string> lines(n);
    for (int i = 0; i < n; ++i)
        cin >> lines[i];
    string s;
    for (int sum = 0; sum <= 2 * n - 2; ++sum) {
        if (sum % 2 == 0) {
            for (int i = n - 1; i >= 0; --i) {
                int j = sum - i;
                if (0 <= j && j < n)
                    s += lines[i][j];
            }
        } else {
            for (int i = 0; i < n; ++i) {
                int j = sum - i;
                if (0 <= j && j < n)
                    s += lines[i][j];
            }
        }
    }
    vector<vector<char>> ans(n, vector<char>(n, 0));
    int cur_x = 0, cur_y = 0;
    int go_x[4] = {0, 1, 0, -1};
    int go_y[4] = {1, 0, -1, 0};
    int step = 0;
    for (int i = 0; i < n * n; ++i) {
        ans[cur_x][cur_y] = s[i];
        int nxt_x = cur_x + go_x[step], nxt_y = cur_y + go_y[step];
        if (nxt_x == -1 || nxt_y == -1 || nxt_x == n || nxt_y == n || ans[nxt_x][nxt_y] != 0) {
            step = (step + 1) % 4;
        }
        cur_x = cur_x + go_x[step], cur_y = cur_y + go_y[step];
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j)
            cout << ans[i][j];
        cout << '\n';
    }
    return 0;
}