#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define SZ(x) ((int)((x).size()))

template <typename T1, typename T2>
string print_iterable(T1 begin_iter, T2 end_iter, int counter) {
    bool done_something = false;
    stringstream res;
    res << "[";
    for (; begin_iter != end_iter and counter; ++begin_iter) {
        done_something = true;
        counter--;
        res << *begin_iter << ", ";
    }
    string str = res.str();
    if (done_something) {
        str.pop_back();
        str.pop_back();
    }
    str += "]";
    return str;
}

vector<int> SortIndex(int size, std::function<bool(int, int)> compare) {
    vector<int> ord(size);
    for (int i = 0; i < size; i++) ord[i] = i;
    sort(ord.begin(), ord.end(), compare);
    return ord;
}

template <typename T>
bool MinPlace(T& a, const T& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
bool MaxPlace(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename S, typename T>
ostream& operator <<(ostream& out, const pair<S, T>& p) {
    out << "{" << p.first << ", " << p.second << "}";
    return out;
}

template <typename T>
ostream& operator <<(ostream& out, const vector<T>& v) {
    out << "[";
    for (int i = 0; i < (int)v.size(); i++) {
        out << v[i];
        if (i != (int)v.size()-1) out << ", ";
    }
    out << "]";
    return out;
}

template<class TH>
void _dbg(const char* name, TH val){
    clog << name << ": " << val << endl;
}
template<class TH, class... TA>
void _dbg(const char* names, TH curr_val, TA... vals) {
    while(*names != ',') clog << *names++;
    clog << ": " << curr_val << ", ";
    _dbg(names+1, vals...);
}

#if DEBUG && !ONLINE_JUDGE
    ifstream input_from_file("input.txt");
    #define cin input_from_file

    #define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
    #define dbg_arr(x, len) clog << #x << ": " << print_iterable(x, x+len, -1) << endl;
#else
    #define dbg(...)
    #define dbg_arr(x, len)
#endif

///////////////////////////////////////////////////////////////////////////
//////////////////// DO NOT TOUCH BEFORE THIS LINE ////////////////////////
///////////////////////////////////////////////////////////////////////////

struct Node {
    Node* sons[26];
    int below[26];
    Node() {
        for (int i = 0; i < 26; i++) sons[i] = nullptr, below[i] = 0;
    }
    Node* get_son(int it) {
        if (sons[it] == nullptr) sons[it] = new Node();
        return sons[it];
    }
};

LL res = 0;
void add(vector<int>& freq, const string& S, int it, Node* v, bool first_run = true) {
    if (it == SZ(S)) return;
    if (it == SZ(S)-1 and !first_run) {
        res += v->below[S.back()-'a']-1;
        // int z = S.back()-'a';
        // dbg(res, z, v->below[z]);
    }
    if (first_run) {
        for (int i = 0; i < 26; i++) v->below[i] += freq[i] > 0;
        freq[S[it]-'a']--;
    }
    v = v->get_son(S[it]-'a');
    add(freq, S, it+1, v, first_run);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); // Remove in problems with online queries!

    int N;
    cin >> N;
    vector<string> S(N);
    Node* root = new Node();
    for (int i = 0; i < N; i++) {
        cin >> S[i];
        reverse(S[i].begin(), S[i].end());
        vector<int> freq(26, 0);
        for (char c: S[i]) freq[c-'a']++;
        add(freq, S[i], 0, root);
    }
    for (int i = 0; i < N; i++) {
        vector<int> freq(26, 0);
        add(freq, S[i], 0, root, false);
    }
    cout << res << "\n";
}


Measured memory_bytes: 316732