#include <bits/stdc++.h>

typedef long double ld;
typedef long long ll;
using namespace std;
int di[] = {1, 0, -1, 0, 0, 1, -1, 1};
int dj[] = {0, 1, 0, -1, -1, 0, 1, -1};

const ll oo = 1e18;
const int N = 55, M = 1e5 + 5, MOD = 998244353;
#define EPS 1e-9

int n, m, k, d;
string s1[N], s2[N];

int main() {
    //  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> s1[i];
    for (int i = 1; i <= n; i++) cin >> s2[i];
    vector<int> v1, v2;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= s1[i].length(); j++) {
            if (s1[i].length() % j) continue;
            bool no = 0;
            for (int k = 0; k < s1[i].length(); k++) {
                if (s1[i][k] != s1[i][k % j]) no = 1;
            }
            if (!no) {
                v1.push_back(j);
                break;
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= s2[i].length(); j++) {
            if (s2[i].length() % j) continue;
            bool no = 0;
            for (int k = 0; k < s2[i].length(); k++) {
                if (s2[i][k] != s2[i][k % j]) no = 1;
            }
            if (!no) {
                v2.push_back(j);
                break;
            }
        }
    }
    sort(v1.begin(), v1.end());
    sort(v2.begin(), v2.end());
    ll ans = 0;
    for (int i = 0; i < n; i++) ans += (v1[i] - v2[i]) * (v1[i] - v2[i]);
    cout << ans;
    return 0;
}