#include<bits/stdc++.h>
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt")
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
#define DBG(a) cerr<< "line "<<__LINE__ <<" : "<< #a <<" --> "<<(a)<<endl
#define eps 1e-8
//#define eq(x,y) (fabs((x)-(y)) < eps)
using namespace std;
typedef long long ll;
//typedef long long LL;
typedef long double Tf;
typedef pair<int,int>pii;
const ll mod = 998244353;
////const ll mod = 1e9+7;
////long double pi = acosl(-1);
//const ll infl = 1e18+100;
const int inf = 1e9+100;
const int nmax = 2e5+5;
//const int MAXLG = log2(nmax)+1;
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
//typedef tree< ll, nullptr_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ost;


void solve(int ces){
    int n;
    cin>>n;
    vector<string>grid(n);
    vector<string>diag(2*n-1);
    for(auto &s : grid) cin>>s;

    for(int i=0; i<n; i++) for(int j=0; j<n; j++){
        diag[i+j].push_back(grid[i][j]);
    }
    string fulString;
    for(int i=0; i<2*n-1; i++){
        if(i%2==0) reverse(diag[i].begin(), diag[i].end());
        fulString += diag[i];
    }
    int cur=0;
    vector< string >ans(n, string(n, 'a') );
    for(int i=0; i<(n+1)/2; i++){
//        int len = n-2*i;

        for(int j=i; j<n-i; j++){
            ans[i][j] = fulString[cur++];
        }
        if(cur==n*n) break;
        for(int k=i+1; k<n-i-1; k++){
            ans[ k ][ n-1-i ] = fulString[cur++];
        }
        for(int j=n-1-i; j>=i; j--){
            ans[ n-1-i ][ j ] = fulString[cur++];
        }
        for(int k=n-i-1-1; k>=i+1; k--){
            ans[ k ][ i ] = fulString[cur++];
        }
    }
    for(auto s : ans){
        cout<<s<<"\n";
    }
}
/*
*/
int main(){
    ios::sync_with_stdio(false); cin.tie(0);

    int tc=1;
//    cin>>tc;
    for(int ces=1; ces<=tc; ces++){
        solve(ces);
    }
}