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

string to_string(string a) { return '"' + a + '"'; }
string to_string(char a) { return "'" + string(1, a) + "'"; }
string to_string(const char* a) { return to_string((string) a); }
string to_string(bool a) { return a ? "true" : "false"; }
template <class T1, class T2>
string to_string(pair<T1, T2> a) {
    return "(" + to_string(a.first) + ", " + to_string(a.second) + ")";
}
template <class T>
string to_string(T a) {
    bool first = true; string res = "{";
    for (const auto& i : a) {
        if (!first) res += ", ";
        first = false;
        res += to_string(i);
    }
    res += "}";
    return res;
}
void debug_out() { cerr << endl; }
template <class T1, class... T2>
void debug_out(T1 a, T2... b) {
    cerr << " " << to_string(a);
    debug_out(b...);
}

#ifdef LOCAL
#define out(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define out(...) 42
#endif

clock_t start_time; void start_timer() { start_time = clock(); }
double get_time() { return (double) (clock() - start_time) / CLOCKS_PER_SEC; }

void Solve();

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
    freopen("../input.txt", "r", stdin);
#endif
    start_timer();
    Solve();
#ifdef LOCAL
    cerr << fixed << setprecision(3);
    cerr << endl << "Time spent: " << get_time() << endl;
#endif
    return 0;
}

const int N = 105;

char a[N][N];
char b[N][N];
bool used[N][N];

void Solve() {
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            used[i][j] = true;
        }
    }
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            cin >> a[i][j];
            used[i][j] = false;
        }
    }
    {
        int i = 1;
        int j = 1;
        int x = 1;
        int y = 1;
        int dx[] = {0, 1, 0, -1};
        int dy[] = {1, 0, -1, 0};
        int ptr = 0;
        for (int q = 1; q <= n * n; q++) {
            b[x][y] = a[i][j];
            used[x][y] = true;
            if ((i + j) % 2 == 1) {
                if (i + 1 <= n && j - 1 >= 1) {
                    i++;
                    j--;
                }
                else if (i < n) {
                    i++;
                }
                else {
                    j++;
                }
            }
            else {
                if (i - 1 >= 1 && j + 1 <= n) {
                    i--;
                    j++;
                }
                else if (j < n) {
                    j++;
                }
                else {
                    i++;
                }
            }
            if (q < n * n) {
                while (true) {
                    int nx = x + dx[ptr];
                    int ny = y + dy[ptr];
                    if (used[nx][ny]) {
                        ptr = (ptr + 1) % 4;
                        continue;
                    }
                    x = nx;
                    y = ny;
                    break;
                }
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            cout << b[i][j];
        }
        cout << "\n";
    }
}