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

const int maxn = 105;
int n;
char grid[maxn][maxn], ans[maxn][maxn];
char dir[] = {'R', 'D', 'L', 'U'};

void solve() {
    cin >> n;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) { 
            cin >> grid[i][j];
            ans[i][j] = '.';
        }
    }
    if (n == 1) {
        cout << grid[0][0];
    } else {
        string res;
        res.push_back(grid[0][0]);
        for (int i = 1; i < n; ++i) {
            bool same = i&1;
            string tmp;
            for (int j = i; j >= 0; --j) {
                tmp.push_back(grid[i - j][j]);
            }
            if (!same) reverse(tmp.begin(), tmp.end());
            res += tmp;
        }
        for (int i = 1; i < n; ++i) {
            bool same = (n&1 ? i&1 : !(i&1));
            string tmp;
            for (int j = 1; j <= n - i; ++j) {
                tmp.push_back(grid[i + j - 1][n - j]);
            }
            if (!same) reverse(tmp.begin(), tmp.end());
            res += tmp;
        }
        // cout << res << endl;
        int cnt = 0, cnt1 = 0, row = 0, col = 0;
        for (int i = 0; i < res.size();) {
            if (dir[cnt % 4] == 'R') {
                while (i < res.size() && row < n && col < n && ans[row][col] == '.') {
                    // cout << "R: " << row << " " << col << " " << res[i] << " " << cnt1 << endl;
                    ans[row][col] = res[i++];
                    col++;
                    cnt1++;
                }
                row++;
                col--;
                cnt++;
            } else if (dir[cnt % 4] == 'D') {
                while (i < res.size() && row < n && col < n && ans[row][col] == '.') {
                    // cout << "D: " << row << " " << col << " " << res[i] << " " << cnt1 << endl;
                    ans[row][col] = res[i++];
                    row++;
                    cnt1++;
                }
                col--;
                row--;
                cnt++;
            } else if (dir[cnt % 4] == 'L') {
                while (i < res.size() && row < n && col >= 0 && ans[row][col] == '.') {
                    // cout << "L: " << row << " " << col << " " << res[i] << " " << cnt1 << endl;
                    ans[row][col] = res[i++];
                    col--;
                    cnt1++;
                }
                row--;
                col++;
                cnt++;
            } else {
                while (i < res.size() && row >= 0 && col < n && ans[row][col] == '.') {
                    // cout << "U: " << row << " " << col << " " << res[i] << " " << cnt1 << endl;
                    ans[row][col] = res[i++];
                    row--;
                    cnt1++;
                }
                col++;
                row++;
                cnt++;
            }
            cnt1 = 0;
        }
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < n; ++j) cout << ans[i][j];
            cout << endl;
        }
    }
}

int main() {
    solve();
    return 0;
}
/*
R: 0 0 T 0
R: 0 1 H 1
R: 0 2 I 2
R: 0 3 S 3
R: 0 4 I 4
D: 1 5 S 0
D: 2 5 A 1
D: 3 5 V 2
D: 4 5 E 3
D: 5 5 R 4
L: 6 4 Y 0
L: 6 3 G 1
L: 6 2 O 2
L: 6 1 O 3
L: 6 0 D 4
U: 5 -1 P 0
U: 4 -1 O 1
U: 3 -1 E 2
U: 2 -1 M 3
U: 1 -1 I 4
R: 0 0 T 0
R: 0 1 H 1
R: 0 2 I 2
R: 0 3 N 3
R: 0 4 K 4
THINK
*/