#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;

#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR2(i, a, b) for (int i = (a); i > (b); --i)
inline bool EQ(double a, double b) { return fabs(a-b) < 1e-9; }

const int INF = 1<<29;
typedef long long ll;

const int MAX = 1024;

char gr[2][MAX][MAX], en[MAX][MAX];
char out[4*MAX*MAX];

int main() {
	while (true)
	{
		int N;
		scanf("%d", &N);
		if (!N) break;
		
		FOR(i, 0, N)
			scanf("%s", gr[0][i]);
		FOR(i, 0, N)
			scanf("%s", en[i]);
		
		int len = 0, act = 0;
		FOR(step, 0, 4)
		{
			FOR(i, 0, N)
				FOR(j, 0, N)
					if (gr[act][i][j] == 'O')
						out[len++] = en[i][j];
			FOR(i, 0, N)
				FOR(j, 0, N)
					gr[1-act][j][N-1-i] = gr[act][i][j];
			act = 1-act;
		}
		
		out[len] = 0;
		printf("%s\n", out);
	}
	
	return 0;
}