#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define Gondozu ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);

using namespace std;
using ll = long long;
using pi = pair<int, int>;
using vi = vector<int>;
using vpi = vector <pair<int, int>>;
using vvi = vector <vector<int>>;

const int OO = 1e9 + 5;
const int N = 2e5 + 5;

vector<int> kmp(const string &s){
    int n = (int)s.length();
    vector<int> pi(n);
    for (int i = 1; i < n; ++i) {
        int len = pi[i-1];
        while (len>0 && s[len] != s[i])
            len = pi[len-1];
        if(s[len] == s[i])
            len++;
        pi[i] = len;
    }
    return pi;
}

int score(string& s){
    vi fail = kmp(s);
    int k = s.length() - fail[s.length()-1];
    return (s.length() % k == 0) ? k : s.length();
}

void TC()
{
    int  n;
    cin >> n;
    vi v1,v2;
    string s;
    for (int i = 0; i < n; ++i) {
        cin >> s;
        v1.pb(score(s));
    }
    for (int i = 0; i < n; ++i) {
        cin >> s;
        v2.pb(score(s));
    }
    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;
}

int32_t main() {
#ifndef ONLINE_JUDGE
    freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#endif
    Gondozu
    int t = 1;
//    cin >> t;
    while (t--) {
        TC();
        cout << '\n';
    }
    return 0;
}