#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <algorithm>
using namespace std;
#define REP(i,a,b) for (int i = (a); i <= (b); ++i)
#define FORI(i,n) REP(i,1,n)
#define FOR(i,n) REP(i,0,int(n)-1)
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define ll long long
#define SZ(x) ((int)(x.size()))
#define IN(x,y) ((y).find((x)) != (y).end())
#define DBG(v) cerr << #v << " = " << (v) << endl;
#define FOREACH(i,t) for (typeof (t.begin()) i = t.begin(); i != t.end(); i++)
#define fi first
#define ALL(v) v.begin(),v.end()
#define se second

char g[1111][1111];
char g1[1111][1111];
char t[1111][1111];


int main () 
{
	while(1)
	{
		int n;scanf("%d",&n);
		
		if (!n) break;
		FOR(i,n) scanf("%s",g[i]);
		FOR(i,n) scanf("%s",t[i]);
		FOR(d,4)
		{
			FOR(i,n) FOR(j,n) if (g[i][j]=='0') printf("%c",t[i][j]);
			FOR(i,n) FOR(j,n) g1[j][n-1-i]=g[i][j];
			FOR(i,n) FOR(j,n) g[i][j]=g1[i][j];
			//FOR(i,n) sort(ALL(h[n2][i]));
		}
		puts("");
	}
	//
	return 0;
}