#include <bits/stdc++.h>
#define db double
#define il inline
#define re register
#define ll long long
#define ui unsigned
#define ull ui ll
#define i128 __int128
#define pii pair<int, int>
#define fi first
#define se second
#define eb emplace_back
#define SZ(v) (int)v.size()
#define ALL(v) v.begin(), v.end()
#define mems(v, x) memset(v, x, sizeof(v))
#define memc(a, b) memcpy(a, b, sizeof(a))
#define FOR(i, L, R) for(re int i = (L); i <= (R); ++i)
#define ROF(i, R, L) for(re int i = (R); i >= (L); --i)
#define LS i << 1, l, mid
#define RS i << 1 | 1, mid + 1, r
#define popc(x) __builtin_popcount(x)
using namespace std;
#define N 1000005
#define P 1000000007
il int add(int x, int y) {return x + y < P ? x + y : x + y - P;}
il void addr(int &x, int y) {(x += y) >= P && (x -= P);}
il int qpow(int p, int n = P - 2) {
  int s = 1;
  while(n) {
    if(n & 1) s = 1ll * s * p % P;
    p = 1ll * p * p % P, n >>= 1;
  }
  return s;
}
// s[i] * (pw[j] - 1) = s[j] * (pw[i] - 1)
int b[N], ib[N];
int n, s[N];
il ll calc(ll x) {return x * (x - 1) / 2;}
il void WORK() {
  ll ans = 0;
  FOR(i, 1, n) {
    string str; cin >> str, s[i] = 0;
    for(auto c : str) s[i] = add(s[i] * 131ll % P, c);
    s[i] = 1ll * s[i] * ib[SZ(str)] % P;
  }
  sort(s + 1, s + 1 + n);
  for(re int l = 1, r; l <= n; l = r + 1) {
    for(r = l; r < n && s[r + 1] == s[r]; ++r);
    ans += calc(r - l + 1);
  }
  cout << ans << "\n";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  b[0] = 1; FOR(i, 1, N - 5) b[i] = 131ll * b[i - 1] % P;
  FOR(i, 0, N - 5) ib[i] = qpow(b[i] - 1);
  while(cin >> n) WORK();
  cerr << 1.0 * clock() / CLOCKS_PER_SEC;
  return 0;
}