#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
#include <climits>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
#include <climits>

// #pragma GCC optimize("O3")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("avx,avx2,fma")

using namespace std;

#define ll long long
#define ld long double

typedef complex<ld> point;

#define polar(r, t) ((r)*exp(point(0, (t))))
#define length(a) (hypot((a).imag(), (a).real()))
#define rotate(v, t) (polar(v, t))
#define X real()
#define Y imag()
#define cp(a, b) ((conj(a) * (b)).imag())
#define EPS 1e-13
// #define M_PI acosl(-1.0l)

const int N = 1e6 + 5, lg = 19, mod = 998244353;
const int M = 1e7 + 5;

int n;

bool fold(string &s, int k) {
    if (s.size() % k) {
        return false;
    }
    string sub = s.substr(0, k);
    for (int i = k; i < s.size(); i += k) {
        if (s.substr(i, k) != sub) {
            return false;
        }
    }
    return true;
}

int score(string &s) {
    for (int k = 1; k <= s.size(); ++k) {
        if (fold(s, k)) {
            return k;
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    vector<int> a(n), b(n);
    for (int i = 0; i < n; ++i) {
        string s;
        cin >> s;
        a[i] = score(s);
    }
    for (int i = 0; i < n; ++i) {
        string s;
        cin >> s;
        b[i] = score(s);
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        ans += (a[i] - b[i]) * (a[i] - b[i]);
    }
    cout << ans << '\n';
    return 0;
}