No tag edit access

The problem statement has recently been changed. View the changes.

×
E. Vowels

time limit per test

4 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputIahubina is tired of so many complicated languages, so she decided to invent a new, simple language. She already made a dictionary consisting of *n* 3-words. A 3-word is a sequence of exactly 3 lowercase letters of the first 24 letters of the English alphabet (*a* to *x*). She decided that some of the letters are vowels, and all the others are consonants. The whole language is based on a simple rule: any word that contains at least one vowel is correct.

Iahubina forgot which letters are the vowels, and wants to find some possible correct sets of vowels. She asks Iahub questions. In each question, she will give Iahub a set of letters considered vowels (in this question). For each question she wants to know how many words of the dictionary are correct, considering the given set of vowels.

Iahubina wants to know the *xor* of the squared answers to all the possible questions. There are 2^{24} different questions, they are all subsets of the set of the first 24 letters of the English alphabet. Help Iahub find that number.

Input

The first line contains one integer, *n* (1 ≤ *n* ≤ 10^{4}). Each of the next *n* lines contains a 3-word consisting of 3 lowercase letters. There will be no two identical 3-words.

Output

Print one number, the *xor* of the squared answers to the queries.

Examples

Input

5

abc

aaa

ada

bcd

def

Output

0

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/18/2022 07:28:09 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|