#include <bits/stdc++.h>
using namespace std;
#define N (int)1e9 + 1
#define all(x) x.begin(), x.end()
int main() {
#ifdef judge
ifstream cin("input.txt");
//ofstream cout("output.txt");
#endif // judge
ios_base :: sync_with_stdio(0);
cin.tie(0) , cout.tie(0);
int n;
cin >> n;
vector<string> a(n);
unordered_map<string , int> sub;
for (int i = 0; i < n; i++) {
cin >> a[i];
unordered_map<string , bool> used;
for (int l = 0; l < (int)a[i].size(); l++) {
string cur = "";
for (int r = l; r < (int)a[i].size(); r++) {
cur += a[i][r];
if (!used[cur]) {
sub[cur]++;
used[cur] = true;
}
}
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans += (sub[a[i]] - 1);
}
cout << ans << '\n';
return 0;
}
