#include <bits/stdc++.h>
using namespace std;
const int maxn = (1 << 24) + 10;
int n;
char st[3];
int f[maxn];
long long Ans;
void FWT() {
  for (long long i = 0; i < 24; i++)
    for (long long sta = 0; sta < 1 << 24; sta++)
      if (sta & (1 << i)) {
        (f[sta] += f[sta ^ (1 << i)]);
      }
}
void Work() {
  FWT();
  for (long long sta = 0; sta < 1 << 24; sta++) {
    long long tmp = n - f[((1 << 24) - 1) ^ sta];
    Ans ^= tmp * tmp;
  }
  printf("%I64d\n", Ans);
}
void Init() {
  scanf("%d", &n);
  for (long long i = 1; i < n + 1; i++) {
    scanf("%s", st);
    int now = 0;
    for (long long j = 0; j < 3; j++) now |= 1 << st[j] - 'a';
    f[now]++;
  }
}
int main() {
  Init();
  Work();
  return 0;
}
