#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    scanf("%d", &n);
    static char a[110][110], b[110][110];
    for (int i = 1; i <= n; i++) scanf("%s", a[i] + 1);
    int x = 1, y = 1, X = 1, Y = 1, dx = -1, dy = 1, D = 0, cnt = 1;
    static const int DX[] = { 0, 1, 0, -1 }, DY[] = { 1, 0, -1, 0 };
    while (cnt <= n * n) {
        b[X][Y] = a[x][y];
        if (x + dx < 1 || x + dx > n || y + dy < 1 || y + dy > n)
            x + dx<1 || x + dx> n ? y == n ? x++ : y++ : x == n ? y++ : x++, swap(dx, dy);
        else
            x += dx, y += dy;
        if (b[X + DX[D]][Y + DY[D]] != '\0' || X + DX[D] < 1 || X + DX[D] > n || Y + DY[D] < 1 ||
            Y + DY[D] > n)
            D = (D + 1) % 4;
        X += DX[D], Y += DY[D], cnt++;
    }
    for (int i = 1; i <= n; i++) printf("%s\n", b[i] + 1);
    return 0;
}