#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rng(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define rep(i,b) rng(i,0,b)
#define repn(i,b) rng(i,1,b+1)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define all(x) x.begin(), x.end()
#define tct template<class t>
#define tctu template<class t, class u>

tctu bool chmax(t&a, u b){ if(a<b){a=b;return true;}return false;}
tct using vc = vector <t>;
	
typedef pair <int,int> P;

constexpr int INF = 1000000000;

int n;
string f[105],ans[105];
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
bool used[105][105];
void solve(){
	cin>>n;
	rep(i,n)cin>>f[i];
	
	string str="";
	bool mx = true;
	rep(sum,2*n-1){
		vc<P>vec;
		rep(i,n){
			int j=sum-i;
			if(0<=j and j<n) vec.eb(i, j);
		}
		if(mx) reverse(all(vec));
		mx ^= true;
		for(auto [x,y]:vec) str.pb(f[x][y]);
	}
	//cout<<str<<endl;
	rep(i,n) ans[i] = f[i];
	int x=0,y=0,d=0;
	rep(t,n*n){
		ans[x][y] = str[t];
		used[x][y] = true;
		x += dx[d];
		y += dy[d];
		if(0<=x and x<n and 0<=y and y<n and !used[x][y]);
		else{
			x += dx[(d+1)%4]-dx[d];
			y += dy[(d+1)%4]-dy[d];
			d = (d+1)%4;
		}
	}
	rep(i,n) cout<<ans[i]<<'\n';
}
					
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(20);
	solve();
}