Suffi$\otimes$

Bihaengssi is weak at strings and keeps studying string algorithms: LCS, KMP, Rabin-Karp, Aho-Corasick...

Bihaengssi's head exploded while staring at suffix arrays, so to cool off, they decide to organize the suffixes of the given strings. Plain sorting is dull, so they XOR the suffix sets instead.

For a string $S$, the suffix set $\text{suffix}[S]$ is the set whose elements are all suffixes of $S$. The XOR $A\otimes B$ of two sets $A$ and $B$ is defined as follows.

$A\otimes B=\{x\mid x\in A\cup B\text{ and }x\not\in A\cap B\}$

On behalf of Bihaengssi, write a program that counts the elements of the set obtained by XORing the suffix sets of the given strings $S_1,S_2,\cdots,S_N$ in order: $(\cdots((\text{suffix}[S_1]\otimes\text{suffix}[S_2])\otimes\text{suffix}[S_3])\cdots\otimes\text{suffix}[S_N])$.

The first line contains an integer $N$. $(1\le N\le 1\,000)$

The following $N$ lines each contain one string $S_i$ made of lowercase English letters only. $(1\le |S_i|\le 50)$

Print the number of elements in $(\cdots((\text{suffix}[S_1]\otimes\text{suffix}[S_2])\otimes\text{suffix}[S_3])\cdots\otimes\text{suffix}[S_N])$.

The empty set has 0 elements.