#include <bits/stdc++.h>
#define fr first
#define sc second
#define all(a) (a).begin(), (a).end()
#define unique(a) a.resize(unique(a.begin(), a.end()) - a.begin())

using namespace std;

#ifdef ONPC
mt19937 rnd(223);
#else
mt19937 rnd(chrono::high_resolution_clock::now()
			.time_since_epoch().count());
#endif

#define TIME (clock() * 1.0 / CLOCKS_PER_SEC)

using ll = long long;
using ld = double;

const int maxn = 1e5 + 100, inf = 1e9 + 100;

char g[110][110];

void solve() {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            cin >> g[i][j];
    string S;
    for (int s = 0; s < 2 * n; s++) {
        string t;
        for (int i = s; i >= 0; i--) {
            int j = s - i;
            if (i >= 0 && j >= 0 && i < n && j < n)
                t.push_back(g[i][j]);
        }
        if (s & 1)
            reverse(all(t));
        S += t;
    }
    reverse(all(S));
    for (int z = 0;; z++) {
        int l = z, r = n - 1 - z;
        if (l > r)
            break;
        auto put = [&](int i, int j) {
            assert(!S.empty());
            g[i][j] = S.back();
            S.pop_back();
        };
        if (l == r) {
            put(l, l);
            break;
        }
        for (int i = l; i < r; i++)
            put(l, i);
        for (int i = l; i < r; i++)
            put(i, r);
        for (int i = r; i > l; i--)
            put(r, i);
        for (int i = r; i > l; i--)
            put(i, l);
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++)
            cout << g[i][j];
        cout << '\n';
    }
}

int main() {
#ifdef ONPC
    freopen("../a.in", "r", stdin);
//    freopen("../a.out", "w", stdout);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout << fixed;
    cout.precision(20);
    solve();
    cerr << "\n\nConsumed " << TIME << endl;
}