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

#define llong long long 
#define len(x) ((int)x.size())
#define rep(i,n) for (int i = -1; ++ i < n; )
#define rep1(i,n) for (int i = 0; i ++ < n; )
#define rand __rand
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());  // or mt19937_64
template<class T = int> T rand(T range = numeric_limits<T>::max()) { return (T)(rng() % range); }

#define CONCAT_(x, y) x##y/*{{{*/
#define CONCAT(x, y) CONCAT_(x, y)
#ifdef LOCAL_DEBUG   
int __db_level = 0;
bool __db_same_line = false;
#define clog cerr << string(!__db_same_line ? __db_level * 2 : 0, ' ')
struct debug_block {
    function<void()> fn;
    void print_name() { __db_same_line = true; fn(); clog << endl; __db_same_line = false;  }
    debug_block(function<void()> fn_): fn(fn_) { clog << "{ "; print_name(); ++__db_level; }
    ~debug_block() { --__db_level; clog << "} "; print_name(); }
};
#define DB(args...) debug_block CONCAT(dbbl, __LINE__)([=]{ clog << args; })
#define deb(...)  if (1) { (clog << "[" #__VA_ARGS__ "] = [" << __VA_ARGS__) << "]"; if (!__db_same_line) clog << endl; }
#else
#define clog if (0) cerr
#define DB(...)
#define deb(...)
#endif
template<class T>
ostream& operator,(ostream& out, const T& thing) { return out << ", " << thing; }
template<class U, class V>
ostream& operator<<(ostream& out, const pair<U, V>& p) { return (out << "(" << p.first, p.second) << ")"; }
template<class A, class B>
ostream& operator<<(ostream& out, const tuple<A, B>& t) { return (out << "(" << get<0>(t), get<1>(t)) << ")"; }
template<class A, class B, class C>
ostream& operator<<(ostream& out, const tuple<A, B, C>& t) { return (out << "(" << get<0>(t), get<1>(t), get<2>(t)) << ")"; }
template<class T> ostream& operator<<(ostream& out, const vector<T>& container) { 
    out << "{";
    if (len(container)) out << container[0];
    rep1(i, len(container) - 1) out, container[i];
    return out << "}";
}
template<class x> vector<typename x::value_type> $v(const x& a) { return vector<typename x::value_type>(a.begin(), a.end()); }
#define ptrtype(x) typename iterator_traits<x>::value_type
template<class u> vector<ptrtype(u)> $v(u a, u b) { return vector<ptrtype(u)>(a, b); }/*}}}*/
// ACTUAL SOLUTION BELOW ////////////////////////////////////////////////////////////

struct trie {
    using sitor = string::const_iterator;
    
    trie* nxt[26];
    int cnt[27];
    
    trie() { 
        memset(nxt, 0, sizeof(nxt));
        memset(cnt, 0, sizeof(cnt));
    } 
    
    ~trie() {
        rep(i, 26) if (nxt[i]) delete nxt[i];
    }
    
    void insert(sitor beg, sitor end) {
        if (beg == end) {
            ++cnt[26];
            return ;
        }
        int cur = beg[0] - 'a';
        if (!nxt[cur]) nxt[cur] = new trie();
        nxt[cur]->insert(++beg, end);
    }
    
    int cal_cnt() {
        // DB("cal cnt"); 
        int total = cnt[26];
        rep(i, 26) {
            if (!nxt[i]) continue;
            int subtotal = nxt[i]->cal_cnt();
            rep(f, 26) {
                cnt[f] += nxt[i]->cnt[f];
            }
            cnt[i] += subtotal - nxt[i]->cnt[i];
            total += subtotal;
        }
        // rep(i, 26) { 
            // if (cnt[i] == 0) continue; 
            // deb(char(i + 'a'), cnt[i]); 
        // } 
        return total;
    }
    
    trie* get(sitor beg, sitor end) {
        if (beg == end) return this;
        int cur = beg[0] - 'a';
        if (!nxt[cur]) return 0;
        return nxt[cur]->get(++beg, end);
    }
};

const int maxn = 201010;
int n;
string s[maxn];
map<string, llong> cnt;
int main(void) {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;
    rep(i, n) {
        cin >> s[i];
        reverse(s[i].begin(), s[i].end());
        cnt[s[i]]++;
    }
    
    trie root;
    rep(i, n) root.insert(s[i].begin(), s[i].end());
    root.cal_cnt();
    
    llong ans = 0;
    for (auto& [cur_s, cs] : cnt) {
        auto t = root.get(cur_s.begin(), prev(cur_s.end()));
        assert(t);
        deb(t, $v(t->cnt, t->cnt + 27));
        ans += cs * (t->cnt[cur_s.back() - 'a'] - cs);
        ans += cs * (cs - 1) / 2;
        deb(cur_s, cs, ans);
    }
    cout << ans;

    return 0;
}

// Remember:
// - Multitest? REFRESHING the data!!!
// - Constrains for each set of data may differs. Should NOT USE the same max constant (maxn)
//   for all of them.
// vim: foldmethod=marker


Measured memory_bytes: 380996