# include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 5;
string s[N];

int kmp[N], n;
int K(string &s) {
  for (int i = 1; i < s.size(); i++) {
		int l = kmp[i];
		while (l && (s[l] != s[i])) {
			l = kmp[l];
		}
		if (s[l] == s[i]) {
			kmp[i + 1] = l + 1;
		} else {
      kmp[i + 1] = 0;
    }
	}
  return kmp[s.size()];
}

int main() {
# ifndef ONLINE_JUDGE
  freopen("in.txt", "r", stdin);
# endif
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  while (cin >> n) {
    unordered_map<string, int> mp;
    for (int i = 1; i <= n; i++) {
      cin >> s[i];
      int x = K(s[i]);
      if (x && s[i].size() % (s[i].size() - x) == 0) {
        string t;
        for (int j = 0; j < s[i].size() - x; j++) {
          t.push_back(s[i][j]);
        }
        s[i] = t;
      }
      ++mp[s[i]];
    }
    long long ans = 0;
    for(auto i : mp) {
      ans += 1ll * i.second * (i.second - 1) / 2;
    }
    cout << ans << '\n';
  }
}