#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <bitset>
#include <cstdio>
#include <string>
#include <iomanip>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define lowbit(x) x&(-x)
#define pi 3.14159265358
#define lc k<<1;
#define rc k<<1|1
#define ppb push_back
#define mod 1000000007
#define fori(i,l,r) for(int i=l;i<=r;i++)
#define forj(j,l,r) for(int j=l;j<=r;j++)
using namespace std;
typedef long long ll;
typedef unsigned long long ULL;
typedef pair <int, int> pll;
const int N = 2e6 + 10;
const int P = 131;
ll n, m, ans = 0;
map<string, ll>mp;
ULL ha[N];
ULL p[N];
int main() {
	ios::sync_with_stdio(0);
	cin.tie();
	cout.tie();
	string s;
	p[0] = 1;
	while (cin >> n) {
		mp.clear();
		for (int i = 1; i <= n; i++){
			cin >> s;
			ll ls = s.size();
			s = " " + s;
			for (int i = 1; i<=ls; i++){
				p[i] = p[i-1] * P;
				ha[i] = ha[i-1] * P+s[i]-'a'+1;
			}int hh;
			for (int i = 1; i <= n; i++){
				int f = 1;
				if (ls%i == 0){
					ll k = ha[i];
					for (int j = i; j <= ls; j += i){
						ll kk = ha[j] - ha[j - i] * p[i];
						if (k != kk){
							f = 0;
							break;
						}
					}if (f){
						hh = i;
						break;
					}
				}
			}string cc = s.substr(1, hh);
			mp[cc]++;
		}ll ans= 0;
		for (auto c : mp){
			ll cf = c.second;
			ans += cf*(cf - 1) / 2;
		}cout << ans << "\n";
	}


}