#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define vsort(a) sort(a.begin(), a.end());
#define mp make_pair
#define v vector
#define sf scanf
#define pf printf
#define MOD1 1000000009LL
#define MOD2 2038072819LL
#define PRI1 610639LL
#define PRI2 949957LL
typedef long long ll;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
void io();
map<pll, set<int>> substrKey;
int N;
pll hsh[20000];
pll calcHsh(string &str, int i, int j) {
ll p1 = 1;
ll ret1 = 0;
FORE(x, i, j) {
ret1 += (ll)(str[x])*p1;
ret1 %= MOD1;
p1 *= PRI1;
p1 %= MOD1;
}
ll p2 = 1;
ll ret2 = 0;
FORE(x, i, j) {
ret2 += (ll)(str[x])*p2;
ret2 %= MOD2;
p2 *= PRI2;
p2 %= MOD2;
}
return{ ret1, ret2 };
}
void setup(string &str, int idx) {
FOR(i,0,str.size()) FOR(j, i, str.size()) {
pll curhsh = calcHsh(str, i, j);
substrKey[curhsh].insert(idx);
if (i == 0 && j == str.size() - 1)
hsh[idx] = curhsh;
}
}
int main() {
//io();
cin >> N;
FOR(i, 0, N) {
string str;
cin >> str;
setup(str, i);
}
ll ans = 0;
FOR(i, 0, N) {
ans += substrKey[hsh[i]].size() - 1;
}
cout << ans << "\n";
return 0;
}
void io() {
#ifndef ONLINE_JUDGE
freopen("input.in", "r", stdin);
freopen("output.out", "w", stdout);
#else
// online submission
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
