//g++ f.cpp -o f -g -std=c++14 -O0 -Wall
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int qd(){
    int rt=0;char c=getchar();
    while(c<'0'||c>'9')  c=getchar();
    while('0'<=c&&c<='9')  rt=(rt<<3)+(rt<<1)+c-48,c=getchar();
    return rt;
}
int qds(int s[]){
    char c=getchar();int rt=0;while(!(('A'<=c&&c<='Z')||('0'<=c&&c<='9')||c==' '))  c=getchar();
    while(('A'<=c&&c<='Z')||('0'<=c&&c<='9')||c==' ')  s[++rt]=c,c=getchar();
    return rt;
}
const int maxn=20,maxm=3010,mod=37;
int N,M,a[maxm],b[maxm],ans[maxm][maxm],f[maxm][maxm],g[maxm],vis[maxm],ni[maxm];
int qsm(int x,int y){int rt=1;for(;y;y>>=1,x=x*x%mod){if(y&1)rt=rt*x%mod;}return rt;}
void add(int x,int y,int v){
    for(int j=1;j<=N+1;j++)  (((f[x][j]-=f[y][j]*v)%=mod)+=mod)%=mod;
}
int solve(){
    int X=M/N,Y=N+1;
    for(int i=1;i<=N;i++)  g[i]=-1;
    for(int i=1;i<=X;i++)  vis[i]=0;
    //for(int i=1;i<=X;i++){for(int j=1;j<=Y;j++){printf("%2d ",f[i][j]);}putchar('\n');}putchar('\n');
    for(int j=1;j<=Y;j++){
        int t=1;while((!f[t][j]||vis[t])&&t<=X)  t++;
        if(t>X)  continue;
        vis[t]=1;//printf("vis %d\n",t);
        for(int i=1;i<=X;i++)  if(t!=i&&f[i][j])  add(i,t,f[i][j]*ni[f[t][j]]%mod);
    //putchar('1');putchar('\n');for(int i=1;i<=M/N;i++){for(int j=1;j<=N+1;j++){printf("%d ",f[i][j]);}putchar('\n');}putchar('\n');
    }
    g[0]=0;
    //for(int i=1;i<=X;i++){for(int j=1;j<=Y;j++){printf("%2d ",f[i][j]);}putchar('\n');}putchar('\n');
    for(int i=1;i<=X;i++){
        int t=1;while(!f[i][t]&&t<=Y)  t++;
        if(t>Y)  continue;
        else if(t==Y)  return 1;
        int x=f[i][Y]*ni[f[i][t]]%mod;
        if(g[t]>=0&&g[t]!=x)  return 1;
        g[t]=x;
        for(t++;t<Y;t++)  if(f[i][t]){g[0]=-1;break;}
    }
    for(int i=0;i<=N;i++)  if(g[i]<0)  return 2;
    return 0;
}
int main(){
    for(int i=1;i<mod;i++)  ni[i]=qsm(i,mod-2);
    N=qd();M=(qds(a)+N-1)/N*N;qds(b);
    for(int i=1;i<=M;i++)
        if('A'<=a[i]&&a[i]<='Z')  a[i]-='A';
        else if('0'<=a[i]&&a[i]<='9')  a[i]=a[i]-'0'+26;
        else a[i]=36;
    for(int i=1;i<=M;i++)
        if('A'<=b[i]&&b[i]<='Z')  b[i]-='A';
        else if('0'<=b[i]&&b[i]<='9')  b[i]=b[i]-'0'+26;
        else b[i]=36;
    int flag=0;
    //for(int i=1;i<=M;i++)  printf("%d ",a[i]);
    //putchar('\n');
    //for(int i=1;i<=M;i++)  printf("%d ",b[i]);
    //putchar('\n');
    for(int i=1;i<=N;i++){
        for(int j=1;j*N<=M;j++){
            for(int k=1;k<=N;k++)  f[j][k]=a[(j-1)*N+k];
            f[j][N+1]=b[(j-1)*N+i];
        }
        int t=solve();
        if(t==1){printf("No solution\n");return 0;}
        else if(t==2){flag=1;continue;}
        for(int j=1;j<=N;j++)  ans[i][j]=g[j];
    }
    if(flag){printf("Too many solutions\n");return 0;}
    for(int i=1;i<=N;i++){for(int j=1;j<=N;j++){printf("%d ",ans[i][j]);}putchar('\n');}
    return 0;
}
/*
10
GZTE6UID8NGE6WRT1G CK24N 2VQCE1RKV5LEYVDTP 4CD0K4VHJM7AKRSWTYAH1374JSC38WM5VCZEVI0EXTWWS5M314M653WKO2FKJPE8W7V
 JMVQECKH2SH8R6RIJGC00PE48ZL9CG03MHMQ54 4RCL483H HVEMARMTU30ZRHVG7OF06AUM68IKCDSTDQJIB6W8UCMCU9ZJ9HQ9ZE3TN6XLE
*/