#include <bits/stdc++.h>

#define vc vector
#define pb emplace_back
#define pii pair <int, int>
#define mkp make_pair
#define rep(i, a, b) for (int i = (a); i <= (b); i ++)
#define lep(i, a, b) for (int i = (a); i >= (b); i --)

using namespace std;
bool ST;

mt19937 gen(chrono::system_clock::now().time_since_epoch().count());
 
inline int read () {
	int x = 0, w = 0; char ch = getchar (); while (!isdigit (ch)) w |= (ch == '-'), ch = getchar ();
	while (isdigit (ch)) x = x * 10 + (ch ^ 48), ch = getchar (); return w ? - x : x;
}

const int N = 1e6 + 5;

int n;
long long ans;
char str[N];

namespace sam {
	int ch[N << 1][26], mx[N << 1], cnt[N << 1], fail[N << 1], idx = 1;
	inline int extend (int p, int c) {
		if (ch[p][c]) {
			if (mx[ch[p][c]] == mx[p] + 1) return ch[p][c];
			int z = ++ idx, y = ch[p][c];
			fail[z] = fail[y];
			fail[y] = z;
			mx[z] = mx[p] + 1;
			memcpy (ch[z], ch[y], sizeof (ch[z]));
			for (; p && ch[p][c] == y; p = fail[p]) ch[p][c] = z;
			return z;
		}
		int x = ++ idx; ++ cnt[x]; mx[x] = mx[p] + 1;
		for (; p && !ch[p][c]; p = fail[p]) ch[p][c] = x;
		if (!p) fail[x] = 1;
		else if (mx[ch[p][c]] == mx[p] + 1) fail[x] = ch[p][c];
		else {
			int z = ++ idx, y = ch[p][c];
			fail[z] = fail[y]; 
			fail[x] = fail[y] = z;
			mx[z] = mx[p] + 1;
			memcpy (ch[z], ch[y], sizeof (ch[z]));
			for (; p && ch[p][c] == y; p = fail[p]) ch[p][c] = z;
		}
		return x;
	}	
}

bool ED;
signed main () {
	cerr << (&ED - &ST) / 1024 / 1024 << "MB ----------------------" << endl; 
	
	n = read (); 
	while (n --) {
		scanf ("%s", str + 1); int m = strlen (str + 1);
		for (int i = 1, u = 1; i <= m; i ++) u = sam :: extend (u, str[i] - 'a');
	}
	
	rep (i, 1, sam :: idx) ans += sam :: mx[i] - sam :: mx[sam :: fail[i]];
	cout << ans << endl;
	
	return 0;
}