#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int INFMEM = 63;
const int INF = 1061109567;
const long long LINF = 4557430888798830399LL;
const double DINF = numeric_limits<double>::infinity();
const long long MOD = 1000000007;
const int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
const double PI = 3.141592653589793;
inline void fastll(long long &input_number) {
  input_number = 0;
  int ch = getchar_unlocked();
  int sign = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') sign = -1;
    ch = getchar_unlocked();
  }
  while (ch >= '0' && ch <= '9') {
    input_number = (input_number << 3) + (input_number << 1) + ch - '0';
    ch = getchar_unlocked();
  }
  input_number *= sign;
}
inline void open(string a) {
  freopen((a + ".in").c_str(), "r", stdin);
  freopen((a + ".out").c_str(), "w", stdout);
}
inline void fasterios() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
long long n;
long long isi[10005];
long long dp[17000000];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    string s;
    cin >> s;
    for (int j = 0; j < 3; j++) {
      isi[i] |= (1LL << (s[j] - 'a'));
    }
    isi[i] = (~isi[i]) & ((1LL << 24) - 1);
    dp[isi[i]]++;
  }
  for (int i = 0; i <= 23; i++) {
    for (int mask = (1LL << 24) - 1; mask >= 0; mask--) {
      if (!(mask & (1LL << i))) dp[mask] += dp[mask ^ (1LL << i)];
    }
  }
  long long ans = 0;
  for (int mask = (1LL << 24) - 1; mask >= 0; mask--) {
    dp[mask] = n - dp[mask];
    ans ^= (dp[mask] * dp[mask]);
  }
  cout << ans << '\n';
  return 0;
}
