#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define all(p) p.begin(),p.end()
using ll =long long;

void solve(){
    int N;
    cin>>N;
    vector<string> S(N);
    rep(i,0,N) cin>>S[i];
    vector<vector<pair<int,int>>> G(N*2-1);
    rep(i,0,N) rep(j,0,N) G[i+j].push_back({i,j});
    vector<pair<int,int>> order1;
    rep(i,0,2*N-1){
        if((i&1)==1) sort(all(G[i]));
        else sort(all(G[i])), reverse(all(G[i]));
        for(auto x:G[i]) order1.push_back(x);
    }
    vector<vector<int>> seen(N,vector<int>(N));
    int x=0,y=0,k=0;
    vector<int> dx={0,1,0,-1};
    vector<int> dy={1,0,-1,0};
    vector<pair<int,int>> order2;
    rep(rp,0,N*N){
        seen[x][y]=1;
        order2.push_back({x,y});
        if(rp+1==N*N) break;
        while(true){
            int nx=x+dx[k],ny=y+dy[k];
            if(min(nx,ny)==-1||max(nx,ny)==N||seen[nx][ny]==1){
                k=(k+1)%4;
                continue;
            }
            x=nx,y=ny;
            break;
        }
    }
    vector<vector<char>> ans(N,vector<char>(N));
    rep(i,0,N*N){
        auto tmp1=order1[i];
        auto tmp2=order2[i];
        ans[tmp2.first][tmp2.second]=S[tmp1.first][tmp1.second];
    }
    rep(i,0,N){
        rep(j,0,N) cout<<ans[i][j];
        cout<<"\n";
    }
}

int main(){
    solve();
}
/*
 5
THSAD
IIVOP
SEOOH
RGETI
YMINK
 */