#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
using i64 = long long;

const int mod = 37;

int mp(char c) {
    if ('A' <= c && c <= 'Z')
        return c - 'A';
    if ('0' <= c && c <= '9')
        return c - '0' + 26;
    return 36;
}

int kpow(int x, int y) {
    int res = 1;
    while (y) {
        if (y & 1)
            res = res * x % mod;
        x = x * x % mod;
        y >>= 1;
    }
    return res;
}

int inv(int x) {
    return kpow(x, mod - 2);
}

int gauss(vector<vector<int> >& a) {
    int n = a.size() - 1, m = a[0].size() - 2;

    // for (int i = 1; i <= n; i++)
    //     for (int j = 1; j <= m + 1; j++)
    //         cout << a[i][j] << " \n"[j == m + 1];
    // cout << endl;

    vector<bool> vis(n + 1);
    for (int i = 1; i <= min(n, m); i++) {
        int p = i;
        for (int j = 1; j <= n; j++) {
            if (vis[j])
                continue;
            if (p == 0 || fabs(a[j][i]) > fabs(a[p][i]))
                p = j;
        }

        if (a[p][i] == 0)
            continue;
        swap(a[i], a[p]);
        vis[i] = true;

        int div = inv(a[i][i]);
        for (int j = m + 1; j >= i; j--)
            a[i][j] = a[i][j] * div % mod;
        for (int j = 1; j <= n; j++) {
            if (j == i)
                continue;
            for (int k = m + 1; k >= i; k--) {
                a[j][k] -= a[i][k] * a[j][i] % mod;
                a[j][k] = (a[j][k] % mod + mod) % mod;
            }
        }

        // for (int i = 1; i <= n; i++)
        //     for (int j = 1; j <= m + 1; j++)
        //         cout << a[i][j] << " \n"[j == m + 1];
        // cout << endl;
    }

    for (int i = 1; i <= n; i++) {
        if (all_of(a[i].begin() + 1, a[i].begin() + m + 1, [](double x) {
            return x == 0;
        }) && a[i][m + 1])
            return -1; // No solution
    }
    int cnt = 0;
    for (int i = 1; i <= min(n, m); i++) {
        if (!all_of(a[i].begin() + 1, a[i].end(), [](double x) {
            return x == 0;
        }))
            cnt++;
    }

    if (cnt != m)
        return 0; //Too many solutions
    return 1;
}

void solve() {
    int m;
    cin >> m;

    string s, t;
    getchar();
    getline(cin, s);
    getline(cin, t);
    while (t.length() % m)
        t.push_back(' ');
    while (s.length() < t.length())
        s.push_back(' ');
    int len = t.length();
    int n = len / m;
    vector a(n + 1, vector<int>(m + 2));
    vector ans(m + 1, vector<int>(m + 1));
    s = " " + s;
    t = " " + t;
    // cout << n << ' ' << m << endl;
    // cout << s << endl << t << endl;

    int tmp = 1;
    for (int i = 1; i <= m; i++) {
        for (int j = 1; j <= len; j++) {
            int x = (j - 1) / m + 1;
            int y = (j - 1) % m + 1;
            a[x][y] = mp(s[j]);
        }
        for (int j = i; j <= len; j += m)
            a[(j - 1) / m + 1][m + 1] = mp(t[j]);

        // for (int u = 0; u <= n; u++) {
        //     cout << '{';
        //     for (int v = 0; v <= m + 1; v++)
        //         cout << a[u][v] << ",}"[v == m + 1];
        //     cout << ",\n";
        // }
        // cout << endl;

        tmp = min(tmp, gauss(a));
        if (tmp == 1) {
            for (int j = 1; j <= m; j++)
                ans[i][j] = a[j][m + 1];
        }
    }

    if (tmp == 1) {
        for (int i = 1; i <= m; i++)
            for (int j = 1; j <= m; j++)
                cout << ans[i][j] << " \n"[j == m];
    } else if (tmp == 0) {
        cout << "Too many solutions\n";
    } else if (tmp == -1) {
        cout << "No solution\n";
    }
}

int main() {
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}