#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;
string s[N];
ll i, n, ans, j, hsh, p[N], l, r;
map <string, int> mk, mp;
ll mult(ll x, ll y) {return (x * y) % M;}
ll sm(ll x, ll y) {return (x + y) % M;}
int main()
{
srand(time(0));
ios_base::sync_with_stdio(0);
iostream::sync_with_stdio(0);
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// in("input.txt");
// out("output.txt");
cin >> n;
for (i = 1; i <= n; i++) cin >> s[i];
for (i = 1; i <= n; i++)
{
mk.clear();
// int cur = 0;
for (l = 0; l < sz(s[i]); l++)
{
hsh = 0;
string t = "";
for (r = l; r < sz(s[i]); r++)
{
t += s[i][r];
if (mk[t]) continue;
mk[t] = 1;
mp[t]++;
}
}
// cout << cur - 1 << el;
}
for (i = 1; i <= n; i++)
{
ans += mp[s[i]];
}
cout << ans - n;
}
