#include <bits/stdc++.h>
using namespace std;
const int Mod = 37;
const int inf = 0x3f3f3f3f;
struct modint
{
    int v;
    modint() : v(0)
    {
    }
    modint(int v) : v(v % Mod)
    {
    }
    int &operator()()
    {
        return v;
    }
    friend modint operator+(modint a, modint b)
    {
        return a() + b();
    }
    friend modint operator-(modint a, modint b)
    {
        return a() + Mod - b();
    }
    friend modint operator*(modint a, modint b)
    {
        return a() * b();
    }
    friend modint operator/(modint a, modint b)
    {
        return a * b.inv();
    }
    friend bool operator>(modint a, modint b)
    {
        return a() > b();
    }
    friend bool operator==(modint a, modint b)
    {
        return a() == b();
    }
    friend bool operator!=(modint a, modint b)
    {
        return a() != b();
    }
    friend modint operator^(modint a, int b)
    {
        modint ans(1);
        while (b)
        {
            if (b & 1)
                ans *= a;
            a *= a, b >>= 1;
        }
        return ans;
    }
    modint inv()
    {
        return (*this) ^ (Mod - 2);
    }
    modint &operator+=(modint b)
    {
        return *this = *this + b;
    }
    modint &operator-=(modint b)
    {
        return *this = *this - b;
    }
    modint &operator*=(modint b)
    {
        return *this = *this * b;
    }
    modint &operator/=(modint b)
    {
        return *this = *this / b;
    }
    modint &operator^=(int b)
    {
        return *this = *this ^ b;
    }
    void read()
    {
        scanf("%llu", &v), v %= Mod;
    }
    void print()
    {
        cout << v;
    }
    void println()
    {
        cout << v << "\n";
    }
};
struct guass
{
    vector<modint> ans;
    int f = 0;

    vector<vector<modint>> a;
    guass(vector<vector<modint>> &M) : a(M)
    {
    }
    ~guass()
    {
    }
    int init()
    {
        int n = a.size();
        int m = a[0].size() - 1;
        ans.resize(m);
        int flag = 0;
        int curi = 0;
        for (int i = 0; i < m; i++)
        {
            for (int j = curi; j < n; j++)
            {
                if (a[j][i] > a[curi][i])
                {
                    swap(a[j], a[curi]);
                }
            }
            if (a[curi][i] == 0)
            {
                continue;
            }
            else
            {
                for (int j = n - 1; j > curi; --j)
                {
                    modint t = a[j][i] / a[curi][i];
                    for (int k = i; k < m + 1; k++)
                    {
                        a[j][k] -= t * a[curi][k];
                    }
                }
                curi++;
            }
        }
        if (curi != m)
        {
            f = inf;
        }
        for (int i = n - 1; i >= curi; i--)
        {
            if (a[i].back() != 0)
            {
                f = -1;
                return 0;
            }
        }
        if (~f && f != inf && curi == m)
        {
            for (int i = curi - 1; i >= 0; i--)
            {
                modint t = a[i].back();
                for (int j = m - 1; j > i; j--)
                {
                    t -= a[i][j] * ans[j];
                }
                ans[i] = t * a[i][i].inv();
            }
        }

        return 0;
    }
};
int mp(char c)
{
    if ('A' <= c && c <= 'Z')
        return c - 'A';
    if ('0' <= c && c <= '9')
        return c - '0' + 26;
    if (c == ' ')
        return 36;
    return 0;
}
void solve()
{
    int m;
    cin >> m;
    cin.ignore();
    string s, t;
    getline(cin, s);
    getline(cin, t);

    int len = s.length();
    while (len % m)
    {
        s.push_back(' ');
        len++;
        t.push_back(' ');
    }

    int n = len / m;
    // cout << s << ' ' << t << endl;
    // cout << m << ' ' << n << endl;
    vector<vector<modint>> ans(m, vector<modint>(m));
    vector<vector<modint>> a(len, vector<modint>(m * m + 1));

    for (int i = 0; i < len; i++)
    {
        for (int j = 0; j < m; j++)
        {
            a[i / m * m + j][i % m + j * m] = mp(s[i]);
        }
        a[i][m * m] = mp(t[i]);
    }

    auto tmp = guass(a);
    tmp.init();
    if (tmp.f > 0)
    {
        cout << "Too many solutions\n";
        return;
    }
    else if (tmp.f == 0)
    {
        for (int i = 0; i < m; i++)
        {
            for (int j = 0; j < m; j++)
            {
                ans[i][j] = tmp.ans[i * m + j];
            }
        }
    }
    else if (tmp.f == -1)
    {
        cout << "No solution\n";
        return;
    }
    for (int i = 0; i < m; i++)
    {
        for (int j = 0; j < m; j++)
            cout << ans[i][j].v << " \n"[j == m - 1];
    }
}

/*
ATTACK AT DAWN
FPLSFA4SUK2W9K3

*/

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