#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define MP make_pair
#define all(x) x.begin(),x.end()
#define Hagry 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;

int score(string& s){
    int n = s.size();
    vi fail(n);
    for(int i=1; i<n; ++i){
        int j = fail[i-1];
        while(j > 0 && s[j] != s[i])
            j = fail[j - 1];
        if(s[j] == s[i])
            ++j;
        fail[i] = j;
    }
    int k = n - fail[n-1];
    if(n % k == 0)
        return k;
    return n;
}

void TC(){
    int n;
    cin >> n;
    vi 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(all(a));
    sort(all(b));
    ll ans = 0;
    for(int i=0; i<n; ++i)
        ans += (b[i] - a[i]) * 1ll * (b[i] - a[i]);
    cout << ans;
}

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