#include <bits/stdc++.h>
using namespace std;
const int m = 1 << 24;
int n;
long long f[20000007];
char s[10];
inline int cnt(int x) {
  int res = 0;
  while (x) ++res, x -= x & (-x);
  return res;
}
void fwt() {
  for (int h = 2; h <= m; h <<= 1)
    for (int i = 0; i < m; i += h)
      for (int j = 0; j < h / 2; ++j) f[i + j + h / 2] += f[i + j];
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    scanf("%s", s);
    int S = 0;
    for (int j = 0; j < 3; ++j) S |= 1 << (s[j] - 'a');
    for (int T = S; T; T = (T - 1) & S)
      if (cnt(T) == 2)
        --f[T];
      else
        ++f[T];
  }
  fwt();
  long long ans = 0;
  for (int i = 0; i < m; ++i) ans ^= (1ll * f[i] * f[i]);
  cout << ans << endl;
  return 0;
}
