#include <bits/stdc++.h>
using namespace std;

const int kN = 1'000'000;

long long pf[kN], vk[kN], vg[kN];
string s[kN];
int lcp[kN];

int main() {
    ios_base::sync_with_stdio(false), cin.tie(0);
    int n; cin >> n;
    for (int i = 0; i < n; ++i) cin >> s[i];
    for (int i = 1; i < n; ++i) {
        for (lcp[i] = 0; lcp[i] < min(s[i].size(), s[i - 1].size()) && s[i][lcp[i]] == s[i - 1][lcp[i]]; ++lcp[i]);
    }
    long long ans = 0;
    for (int i = 0; i < n; ++i) ans += s[i].size();
    for (int i = 0; i < n; ++i) {
        pf[i] = i;
        if (i > 0) pf[i] += pf[i - 1];
    }
    vector<int> v;
    long long x = 0, y = 0;
    for (int i = 1; i < n; ++i) {
        while (!v.empty() && lcp[v.back()] >= lcp[i]) {
            x -= vk[v.back()];
            y -= vg[v.back()];
            v.pop_back();
        }
        long long sv = !v.empty() ? pf[i - 1] - pf[v.back() - 1] : pf[i - 1];
        int dt = !v.empty() ? i - v.back() : i;
        x += vk[i] = sv * lcp[i];
        y += vg[i] = dt * lcp[i];
        v.push_back(i);
        // cout << "lcp = " << lcp[i] << " delta = " << y * (i + 1) - x << endl;
        ans += y * (i + 1) - x;
    }
    cout << ans << endl;
    return 0;
}