#include <bits/stdc++.h>

using namespace std;

#define iter(v) v.begin(), v.end()
#define SZ(v) int(v.size())
#define pb emplace_back
#define ff first
#define ss second

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#ifdef zisk
void debug() { cerr << "\n"; }
template<class T, class ... U>
void debug(T a, U ... b){ cerr << a << " ", debug(b...); }
template<class T>
void pary(T l, T r) {
	while (l != r) cerr << *l << " ", l++;
	cerr << "\n";
}
#else
#define debug(...) void()
#define pary(...) void()
#endif

template<class A, class B>
ostream &operator<<(ostream &o, pair<A, B> p) {
	return o << '(' << p.ff << ',' << p.ss << ')';
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	int n;
	cin >> n;

	vector<string> s(n);
	vector<pii> ord;
	const int sz = 40;
	vector rank(sz, vector<vector<int>>(n));
	for (int i = 0; i < n; i++) {
		cin >> s[i];
		for (int j = 0; j < sz; j++)
			rank[j][i].resize(SZ(s[i]));
		for (int j = 0; j < SZ(s[i]); j++)
			ord.pb(pii(i, j));
	}
	auto get_char = [&](pii p) {
		return s[p.ff][p.ss];
	};
	sort(iter(ord), [&](pii x, pii y) {
		return get_char(x) < get_char(y);
	});
	{
		char lst = 0;
		int rk = -1;
		for (int i = 0; i < SZ(ord); i++) {
			auto [x, y] = ord[i];
			if (get_char(ord[i]) != lst) {
				rk++;
				lst = get_char(ord[i]);
			}
			rank[0][x][y] = rk;
		}
	}
	//pary(iter(ord));

	for (int t = 0; t < sz - 1; t++) {
		vector<vector<pii>> bucket(SZ(ord));
		for (auto [x, y] : ord) {
			int ty = (y - (1LL << t)) % SZ(s[x]);
			ty = (ty + SZ(s[x])) % SZ(s[x]);
			//debug("QQ", x, y, ty);
			bucket[rank[t][x][ty]].pb(pii(x, ty));
		}
		auto get_pair = [&](pii p) {
			auto [x, y] = p;
			return pii(rank[t][x][y], rank[t][x][(y + (1LL << t)) % SZ(s[x])]);
		};
		/*sort(iter(ord), [&](pii x, pii y) {
			return get_pair(x) < get_pair(y);
		});*/
		ord.clear();
		for (int i = 0; i < SZ(bucket); i++)
			for (auto &p : bucket[i]) ord.pb(p);
		//pary(iter(ord));
		pii lst = pii(-1, -1);
		int rk = -1;
		for (int i = 0; i < SZ(ord); i++) {
			auto [x, y] = ord[i];
			if (get_pair(ord[i]) != lst) {
				rk++;
				lst = get_pair(ord[i]);
			}
			rank[t + 1][x][y] = rk;
		}
	}

	vector<ll> lcp(SZ(ord));
	for (int i = 0; i + 1 < SZ(ord); i++) {
		auto [x1, y1] = ord[i];
		auto [x2, y2] = ord[i + 1];
		for (int t = sz - 1; t >= 0; t--) {
			if (rank[t][x1][y1] != rank[t][x2][y2]) continue;
			y1 = (y1 + (1LL << t)) % SZ(s[x1]);
			y2 = (y2 + (1LL << t)) % SZ(s[x2]);
			lcp[i] += 1LL << t;
		}
	}

	vector<vector<ll>> tab(21, vector<ll>(SZ(ord)));
	tab[0] = lcp;
	for (int i = 1; i <= 20; i++) {
		for (int j = 0; j + (1 << i) - 1 < SZ(ord); j++) {
			tab[i][j] = min(tab[i - 1][j], tab[i - 1][j + (1 << (i - 1))]);
		}
	}
	auto query = [&](int l, int r) {
		int lg = __lg(r - l + 1);
		//debug("query", l, r, ":", min(tab[lg][l], tab[lg][r - (1 << lg) + 1]));
		return min(tab[lg][l], tab[lg][r - (1 << lg) + 1]);
	};

	vector<int> all;
	int id = 0;
	for (auto [x, y] : ord) {
		if (y == 0) all.pb(id)/*, debug("test", x)*/;
		id++;
	}

	auto find_next = [&](int x, ll low) {
		int l = x, r = n;
		while (l + 1 < r) {
			int mid = (l + r) / 2;
			if (query(all[l], all[mid] - 1) > low) l = mid;
			else r = mid;
		}
		return l;
	};
	/*pary(iter(ord));
	pary(iter(all));
	pary(iter(lcp));*/

	ll ans = 0;
	auto dfs1 = [&](auto dfs, int tl, int tr) -> void {
		if (tl >= tr) return;
		ll pos = query(all[tl], all[tr] - 1);
		if (pos > 1e12) return;
		//debug("try", tl, tr, ",", pos);
		int mid1 = find_next(tl, pos);
		//if (mid1 >= tr) return;
		assert(mid1 < tr);
		int mid2 = find_next(mid1 + 1, pos);
		//debug("dfs", tl, tr, ",", pos, ":", mid1, mid2);
		// [tl, mid1] [mid1 + 1, mid2] [mid2 + 1, tr]
		if (mid2 + 1 <= tr) {
			ans += (ll)(mid1 - tl + 1) * (mid2 - mid1)  * (tr - mid2);
		}
		dfs(dfs, tl, mid1);
		dfs(dfs, mid1 + 1, mid2);
		dfs(dfs, mid2 + 1, tr);
	};
	dfs1(dfs1, 0, n - 1);
	cout << ans << "\n";

}