#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#define MOD 1000000007
#define MOD2 998244353
#define int long long
#define double long double
#define EPS 1e-9
//#define PI 3.14159265358979

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

template < typename T >
ostream &operator<<(ostream &os, const vector< T > &A) {
	for (int i = 0; i < A.size(); i++)
		os << A[i] << " ";
	os << endl;
	return os;
}
template <>
ostream &operator<<(ostream &os, const vector< vector< int > > &A) {
	int N = A.size();
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < A[i].size(); j++)
			os << A[i][j] << " ";
		os << endl;
	}
	return os;
}

typedef pair< int, int > pii;
typedef long long ll;

struct edge {
	int from, to, d, c;
	edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
		from = _from;
		to = _to;
		d = _d;
		c = _c;
	}
	bool operator<(const edge &rhs) const {
		return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
	}
};
struct aabb {
	int x1, y1, x2, y2;
	aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};

typedef vector< edge > edges;
typedef vector< edges > graph;
struct flow {
	int to, cap, rev, cost;
	flow(int to = 0, int cap = 0, int rev = 0, int cost = 0) : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector< vector< flow > > flows;

const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);

int pow2(int n) { return 1LL << n; }
template < typename T, typename U >
bool chmin(T &x, const U &y) {
	if (x > y) {
		x = y;
		return true;
	}
	return false;
}
template < typename T, typename U >
bool chmax(T &x, const U &y) {
	if (x < y) {
		x = y;
		return true;
	}
	return false;
}

struct initializer {
	initializer() {
		cout << fixed << setprecision(20);
	}
};
initializer _____;
struct TrieTree {
	struct Node {
		char c;
		int level;
		int last = 0;
		unordered_map< char, int > next;
		Node(char _c, int _l) : c(_c), level(_l) {}
		Node() {}
	};
	vector< Node > nodes;
	TrieTree() {
		nodes.resize(1);
		nodes[0].c = '.';
		nodes[0].level = 0;
	}
	bool find(const string &S) {
		bool ret = true;
		int j = 0;
		int N = S.size();
		rep(i, N) {
			char c = S[i];
			if (nodes[j].next[c] == 0) {
				ret = false;
				break;
			} else {
				j = nodes[j].next[c];
			}
		}
		//if(nodes[j].last==0)ret=0;
		return ret;
	}
	void add(const string &S) {
		int j = 0;
		int N = S.size();
		rep(i, N) {
			char c = S[i];
			if (nodes[j].next[c] == 0) {
				nodes[j].next[c] = nodes.size();
				nodes.push_back(Node(c, i + 1));
			}
			j = nodes[j].next[c];
		}
		nodes[j].last = 1;
	}
	vector< vector< int > > count;
	int dfs1(int x) {
		int ret = 0;
		for (auto p : nodes[x].next) {
			int tmp = dfs1(p.second);
			rep(j, 26) count[x][j] += count[p.second][j];
			count[x][p.first - 'a'] += tmp - count[p.second][p.first - 'a'];
			ret += tmp;
		}
		return ret + nodes[x].last;
	}
	void dfs2(int x, int &ans) {
		for (auto p : nodes[x].next) {
			if (nodes[p.second].last) {
				count[x][p.first - 'a']--;
				ans += count[x][p.first - 'a'];
				dfs2(p.second, ans);
			} else {
				dfs2(p.second, ans);
			}
		}
	}
	int solve() {
		count.resize(nodes.size(), vector< int >(26, 0));
		dfs1(0);
		int ans = 0;
		dfs2(0, ans);
		return ans;
	}
};
int N, M, K, T, Q, H, W;
signed main() {
	cin >> N;
	vector< string > A(N);
	rep(i, N) cin >> A[i];
	rep(i, N) reverse(A[i].begin(), A[i].end());
	sort(A.begin(), A.end());
	TrieTree tt;
	rep(i, N) tt.add(A[i]);
	cout << tt.solve() << endl;
	return 0;
}

Measured memory_bytes: 458180