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

#define F first
#define S second
#define ar array
typedef int uci;
#define int long long
#define ll long long
int n;

bool good(int a, int b){
    return a >= 0 && a < n && b >= 0 && b < n;
}
void solve(){
    cin >> n;
    vector<string> a(n);
    for(int i{}; i < n; ++i)
        cin >> a[i];

    vector<string> out;
    out = a;

    int x{}, y{};
    int b{}, c{};

    int lb = 0, rb = n-1;
    int up = 1, down = n-1;
    vector<ar<int, 2>> delt{{0, 1}, {1, -1}, {1, 0}, {-1, 1}};
    vector<ar<int, 2>> delt2{{0, 1}, {1, 0}, {0, -1}, {-1, 0}};

    int indf{};
    int inds{};
    vector<vector<bool>> vis(n, vector<bool>(n));
    for(int i{}; i < n*n; ++i){
        out[b][c] = a[x][y];
        if(i == n*n-1)
            break;
        int nx = x+delt[indf][0];
        int ny = y+delt[indf][1];
        while(!good(nx, ny)){
            indf = (indf+1)%4;
            nx = x+delt[indf][0];
            ny = y+delt[indf][1];
        }
        x = nx, y = ny;
        if(indf == 0 || indf == 2)
            indf = (indf+1)%4;
        if(x == 0 && y == n-1)
            swap(delt[0], delt[2]);

        vis[b][c] = true;
        int nb = b + delt2[inds][0];
        int nc = c + delt2[inds][1];
        while(!good(nb, nc) || vis[nb][nc]){
            inds = (inds+1)%4;
            nb = b + delt2[inds][0];
            nc = c + delt2[inds][1];
        }
        b = nb, c = nc;
    }

    for(auto &t : out)
        cout << t << '\n';
}


uci main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    solve();
}