#include <bits/stdc++.h>
using namespace std;
int n, i, j, k;
short int dp[1 << 24], diff[1 << 24], cnt[1 << 24], d[1 << 24];
string s;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie();
  cin >> n;
  dp[0] = n;
  for (i = 0; i < n; i++) {
    cin >> s;
    d[(1 << (s[0] - 'a')) | (1 << (s[1] - 'a')) | (1 << (s[2] - 'a'))]++;
    for (j = 0; j < 24; j++) {
      if (j != s[0] - 'a' && j != s[1] - 'a' && j != s[2] - 'a') {
        dp[1 << j]++;
      }
    }
  }
  for (i = 1; i < (1 << 24); i++) cnt[i] = cnt[i >> 1] + (i & 1);
  int ans = 0;
  for (i = 0; i < (1 << 24); i++) {
    if (cnt[i] > 1) {
      int x = i & (i - 1), y = (x ^ i) | (x & (x - 1));
      dp[i] = dp[x];
      diff[i] = diff[y];
      for (j = 0; j < 24; j++) {
        if (!(y & (1 << j))) diff[i] -= d[(i ^ x) | (i ^ y) | (1 << j)];
      }
      dp[i] -= diff[i];
    } else
      diff[i] = n - dp[i];
    ans ^= ((n - dp[i]) * (n - dp[i]));
  }
  cout << ans << endl;
  return 0;
}
