#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long inf = 1e18 * 4;
const long double pai = acos(-1);
const long long MX = (1 << 24) - 1;
int n;
int a[10009];
int dp[(1 << 24) + 9];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    for (int j = 0; j < s.size(); j++) {
      int x = s[j] - 'a';
      a[i] |= (1 << x);
    }
    dp[a[i]]++;
  }
  for (int i = 0; i < 24; i++) {
    for (int mask = 0; mask <= MX; mask++) {
      if ((mask & (1 << i))) dp[mask] += dp[(mask ^ (1 << i))];
    }
  }
  int ANS = 0;
  for (int mask = 0; mask <= MX; mask++) {
    int MASK = (MX ^ mask);
    int ans = n - dp[MASK];
    ans *= ans;
    ANS ^= ans;
  }
  cout << ANS << endl;
}
