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

#define int long long
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n) for (int i = 1; i <= (int) (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a) - 1) / (b) + 1)
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
int gcd(int a, int b) {
    while (b) { swap(a %= b, b); }
    return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int sign(int x) { return (x > 0) - (x < 0); }
template<typename T> void fin(T mes) {
    cout << mes << endl;
    exit(0);
}
template<typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
    os << "(" << rhs.first << ", " << rhs.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const deque<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const set<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

int N;
string S[220000];
int node = 1; //ノード数
vector<pair<char, int>> G[1100000];
int band[1100000], stop[1100000];
int ans = 0;
int cnt[26];
void dfs(int x) {
    rep(i, G[x].size()) {
        int c = G[x][i].first - 'a';
        int to = G[x][i].second;
        cnt[c] += stop[to];
    }
    rep(i, G[x].size()) {
        int c = G[x][i].first - 'a';
        int to = G[x][i].second;
        ans += cnt[c] * band[to];
        int tmp = cnt[c];
        cnt[c] = 0;
        dfs(to);
        cnt[c] = tmp;
    }
    rep(i, G[x].size()) {
        int c = G[x][i].first - 'a';
        int to = G[x][i].second;
        cnt[c] -= stop[to];
    }
}
signed main() {
    cin >> N;
    rep(i, N) {
        cin >> S[i];
        reverse(all(S[i]));
    }
    rep(i, N) {
        int cur = 0;
        rep(j, S[i].length()) {
            rep(k, G[cur].size()) {
                if (S[i][j] == G[cur][k].first) {
                    cur = G[cur][k].second;
                    band[cur]++;
                    goto label;
                }
            }
            G[cur].push_back({S[i][j], node});
            cur = node;
            band[cur]++;
            node++;
            label:;
        }
        stop[cur]++;
    }
    dfs(0);
    ans -= N;
    cout << ans << endl;
}

Measured memory_bytes: 136156