//Author:xht37
#include <bits/stdc++.h>

#define ui unsigned int
#define ll long long
#define ul unsigned ll
#define ld long double

#define pi pair <int, int>
#define fi first
#define se second
#define mp make_pair

#define ls (p << 1)
#define rs (ls | 1)
#define md ((t[p].l + t[p].r) >> 1)

#define vi vector <int>
#define pb push_back
#define pq priority_queue

#define dbg(x) cerr << #x" = " << (x) << endl
#define debug(...) fprintf(stderr, __VA_ARGS__)

#define fl(x) freopen(x".in", "r", stdin), freopen(x".out", "w", stdout)

using namespace std;

namespace io {
	const int SI = 1 << 21 | 1;
	char IB[SI], *IS, *IT, OB[SI], *OS = OB, *OT = OS + SI - 1, c, ch[100];
	int f, t;
	#define gc() (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin), IS == IT ? EOF : *IS++) : *IS++)
	inline void flush() {
		fwrite(OB, 1, OS - OB, stdout), OS = OB;
	}
	inline void pc(char x) {
		*OS++ = x;
		if (OS == OT) flush();
	}

	template <class I>
	inline void rd(I &x) {
		for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;
		for (x = 0; c >= '0' && c <= '9'; x = (x << 3) + (x << 1) + (c & 15), c = gc());
		x *= f;
	}
	template <class I>
	inline void rd(I &x, I &y) {
		rd(x), rd(y);
	}
	template <class I>
	inline void rd(I &x, I &y, I &z) {
		rd(x), rd(y), rd(z);
	}
	template <class I>
	inline void rda(I *a, int n) {
		for (int i = 1; i <= n; i++) rd(a[i]);
	}
	inline void rdc(char &c) {
		for (c = gc(); c < 33 || c > 126; c = gc());
	}
	inline void rds(char *s, int &n) {
		for (c = gc(); c < 33 || c > 126; c = gc());
		for (n = 0; c >= 33 && c <= 126; s[++n] = c, c = gc());
	}
	inline void rds(string &s) {
		for (c = gc(); c < 33 || c > 126; c = gc());
		for (s.clear(); c >= 33 && c <= 126; s.pb(c), c = gc());
	}

	template <class I>
	inline void print(I x, char k = '\n') {
		if (!x) pc('0');
		if (x < 0) pc('-'), x = -x;
		while (x) ch[++t] = x % 10 + '0', x /= 10;
		while (t) pc(ch[t--]);
		pc(k);
	}
	template <class I>
	inline void print(I x, I y) {
		print(x, ' '), print(y);
	}
	template <class I>
	inline void print(I x, I y, I z) {
		print(x, ' '), print(y, ' '), print(z);
	}
	template <class I>
	inline void printa(I *a, int n) {
		for (int i = 1; i <= n; i++) print(a[i], " \n"[i==n]);
	}
	inline void printc(char c) {
		pc(c);
	}
	inline void prints(char *s, int n) {
		for (int i = 1; i <= n; i++) pc(s[i]);
		pc('\n');
	}
	inline void prints(string s) {
		int n = s.length();
		while (t < n) pc(s[t++]);
		pc('\n'), t = 0;
	}
	struct Flush {
		~Flush() {
			flush();
		}
	} flusher;
}
using io::rd;
using io::rda;
using io::rdc;
using io::rds;
using io::print;
using io::printa;
using io::printc;
using io::prints;

const int P[2] = {998244353, 998244853}, H = 19491001;
struct Hash {
    int a[2];
    inline Hash() {}
    inline Hash(int x) {
        a[0] = a[1] = x;
    }
    inline Hash(int x, int y) {
        a[0] = x, a[1] = y;
    }
    inline friend bool operator == (Hash x, Hash y) {
        for (int i = 0; i < 2; i++)
            if (x.a[i] != y.a[i]) return 0;
        return 1;
    }
    inline friend Hash operator + (Hash x, Hash y) {
        for (int i = 0; i < 2; i++)
            x.a[i] = (x.a[i] + y.a[i]) % P[i];
        return x;
    }
    inline friend Hash operator - (Hash x, Hash y) {
        for (int i = 0; i < 2; i++)
            x.a[i] = (x.a[i] - y.a[i] + P[i]) % P[i];
        return x;
    }
    inline friend Hash operator * (Hash x, Hash y) {
        for (int i = 0; i < 2; i++)
            x.a[i] = 1ll * x.a[i] * y.a[i] % P[i];
        return x;
    }
    inline ll h() {
        return ((ll)1e9 * a[1] + a[0]) % H;
    }
};

const Hash B = Hash(131, 13331);

const int N = 2e5 + 7;
int n, m;
string s[N];
vector<Hash> h[N];

int hh[H], he[N], hc[N], ht[N], tot;

inline void add(int x, int y, int z) {
    for (int i = hh[x]; i; i = ht[i])
        if (he[i] == y) return hc[i] += z, void();
    he[++tot] = y, hc[tot] = z, ht[tot] = hh[x], hh[x] = tot;
}

inline int ask(int x, int y) {
    for (int i = hh[x]; i; i = ht[i])
        if (he[i] == y) return hc[i];
    return 0;
}

/* 

const int N = 2e5 + 7, M = 1e6 + 7;
const modint B = 13331;
modint p[M];
int n;
string s[N];
vector<modint> h[N];
vi e[N];

struct BIT {
	int c[N];
	bool v[N];
    inline void add(int x) {
    	if (v[x]) return;
    	v[x] = 1;
        while (x <= n) c[x]++, x += x & -x;
    }
    inline int ask(int x) {
        int k = 0;
        while (x) k += c[x], x -= x & -x;
        return k;
    }
} c[26];

inline modint H(int x, int l, int r) {
	if (!l) return h[x][r];
	return h[x][r] - h[x][l-1] * p[r-l+1];
}

inline bool cmp(int i, int j) {
	int l = 0, r = min(s[i].size(), s[j].size()) - 1;
	while (l < r) {
		int d = (l + r + 1) / 2;
		if (H(i, l, d) == H(j, l, d)) l = d;
		else r = d - 1;
	}
	if (l == (int)s[i].size() - 1) return 1;
	if (r == (int)s[j].size() - 1) return 0;
	return s[i][l] < s[j][r];
}

int f[N], s[N];

int get(int x) {
	return x == f[x] ? x : (f[x] = get(f[x]));
}

inline void merge(int x, int y) {
	if (s[x] < s[y]) swap(x, y);
	f[y] = x, s[x] += s[y];
}
*/

ll ans;

int main() {
	rd(n);
	for (int i = 1; i <= n; i++) {
		rds(s[i]), reverse(s[i].begin(), s[i].end());
		h[i].resize(s[i].size());
		h[i][0] = s[i][0];
		for (ui j = 1; j < s[i].size(); j++)
			h[i][j] = h[i][j-1] * B + s[i][j];
		add(h[i][s[i].size()-1].h(), h[i][s[i].size()-1].a[0], 1);
	}
	for (int i = 1; i <= n; i++) {
		static bool v[26];
		memset(v, 0, sizeof(v));
		for (int j = s[i].size() - 1; ~j; j--) {
			v[s[i][j]-'a'] = 1;
			if (j != (int)s[i].size() - 1) {
				Hash o = j ? h[i][j-1] : 0;
				for (int k = 0; k < 26; k++)
					if (v[k]) {
						Hash w = o * B + (k + 'a');
						ans += ask(w.h(), w.a[0]);
					}
			}
		}
	}
	print(ans);
	return 0;
}

Measured memory_bytes: 104164