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

#define rep(i,a,b) for (int i=a; i<b; i++)
#define trav(a,b) for (auto a:b)
#define all(x) begin(x),end(x)
#define lld long long

void solve() {
	int n;
	cin >> n;
	vector< vector<char> > mat(n, vector<char>(n));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			cin >> mat[i][j];
		}
	}
	map< int, vector<char> > diag;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			diag[i + j].emplace_back( mat[i][j] ) ;
		}
	}
	vector<char> here;
	int cc = 0;
	for (auto [diff, values] : diag) {
		//cout << diff << '\n';
		if ((cc ^ 1) & 1) reverse(values.begin(), values.end());
		for (auto& value : values) {
			here.emplace_back(value);
		}
		cc ^= 1 ;
	}
	vector<int> dr = {+0, +1, -1, +0};
	vector<int> dc = {+1, +0, +0, -1};
	
	
	vector< vector<int> > vis(n, vector<int>(n, 0));
	vector< pair<int, int> > pos;
	auto dfs = [&](auto&& dfs, int r, int c, int dir) -> void {
		assert(vis[r][c] == 0);
		vis[r][c] = 1;
		pos.emplace_back(r, c);
		for (int i = 0; i < 4; i++) {
			if (r + dr[(dir + i) % 4] < 0 || r +  dr[(dir + i) % 4] >= n) continue;
			if (c + dc[(dir + i) % 4] < 0 || c +  dc[(dir + i) % 4] >= n) continue;
			if (vis[r + dr[(dir + i) % 4]][c +  dc[(dir + i) % 4]]) continue;
			dfs(dfs, r + dr[(dir + i) % 4], c +  dc[(dir + i) % 4], (dir + i) % 4);
			return;
		}
	};
	dfs(dfs, 0, 0, 0);
	vector< vector<char> > ans(n, vector<char>(n));
	assert( (int) here.size() == n * n );
	int ptr = 0;
	for (auto [r, c] : pos) {
		ans[r][c] = here[ptr++];
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			cout << ans[i][j];
		}
		cout << '\n';
	}
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt = 1;
	//cin >> tt;
	while (tt--) solve();
	return 0; 
}