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

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	int n; cin >> n;
	vector<vector<char>> c(n, vector<char>(n));
	rep(i,0,n)rep(j,0,n)cin>>c[i][j];
	vector<pair<int,int>> order_old;
	vector<pair<int,int>> order_new;
	{
		int cnt = 0;
		rep(r, 0, n*2 + 1){
			if (r % 2 == 0){
				int x = r;
				int y = 0;
				rep(t,0,n*4){
					if (0 <= x && x < n && 0 <= y && y < n){
						order_old.push_back(pair(x, y));
						cnt++;
					}
					x -= 1;
					y += 1;
				}
			}else{
				int x = 0;
				int y = r;
				rep(t,0,n*4){
					if (0 <= x && x < n && 0 <= y && y < n){
						order_old.push_back(pair(x, y));
						cnt++;
					}
					x += 1;
					y -= 1;
				}
			}
		}
		assert(cnt == n * n);
	}
	{
		int cnt = 0;
		vector<int> dx = {0, 1, 0, -1};
		vector<int> dy = {1, 0, -1, 0};
		vector tansaku(n, vector<bool>(n));
		tansaku[0][0] = 1;
		int x = 0;
		int y = 0;
		auto valid = [&](int x, int y) -> bool {
			if (!(0 <= x && x < n)) return false;
			if (!(0 <= y && y < n)) return false;
			if (tansaku[x][y]) return false;
			return true;	
		};
		int now = 0;
		while (cnt < n * n){
			order_new.push_back(pair(x, y));
			cnt++;
			x += dx[now];
			y += dy[now];
			if (!valid(x, y)){
				x -= dx[now];
				y -= dy[now];
				now += 1;
				now %= 4;
				x += dx[now];
				y += dy[now];
			}
			tansaku[x][y] = true;
		}
		assert(cnt == n * n);
		rep(i,0,n){
			rep(j,0,n){
				assert(tansaku[i][j]);
			}
		}
	}

	vector<vector<char>> ans(n, vector<char>(n));
	
	rep(i,0,n * n){
		auto [x, y] = order_old[i];
		char t = c[x][y];
		auto [v, w] = order_new[i];
		ans[v][w] = t;
	}
	
	rep(i,0,n){
		rep(j,0,n){
			cout << ans[i][j];
		}
		cout << '\n';
	}
}