#include <algorithm>
#include <iostream>
#include <vector>
#include <set>
#include <map>

using namespace std;

char a[111][111];


int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	for (int i = 1 ; i <= n ; ++ i) {
		for (int j = 1 ; j <= n ; ++ j) {
			cin >> a[i][j];
		}
	}
	string s;
	for (int d = 1 ; d <= 2 * n ; ++ d) {
		if (d % 2 == 0) {
			for (int j = 1 ; j <= n ; ++ j) {
				int i = d - j;
				if (1 <= i && i <= n) {
					s += a[i][j];
				}
			}
		} else {
			for (int i = 1 ; i <= n ; ++ i) {
				int j = d - i;
				if (1 <= j && j <= n) {
					s += a[i][j];
				}
			}
		}
	}
	for (int i = 1 ; i <= n ; ++ i) {
		for (int j = 1 ; j <= n ; ++ j) {
			a[i][j] = '-';
		}
	}
	int l = 0;
	int x = 1, y = 1;
	while (a[x][y] == '-' && l < s.size()) {
		while (1) {
			if (l < s.size()) a[x][y] = s[l++];
			if (a[x][y + 1] != '-') break;
			y++;
		}
		++x;
		while (1) {
			if (l < s.size()) a[x][y] = s[l++];
			if (a[x + 1][y] != '-') break;
			x++;
		}
		y--;
		while (1) {
			if (l < s.size()) a[x][y] = s[l++];
			if (a[x][y - 1] != '-') break;
			y--;
		}
		x--;
		while (1) {
			if (l < s.size()) a[x][y] = s[l++];
			if (a[x - 1][y] != '-') break;
			x--;
		}
		y++;
	}
	for (int i = 1 ; i <= n ; ++ i) {
		for (int j = 1 ; j <= n ; ++ j) {
			cout << a[i][j];
		}
		cout << endl;
	}
}