Spring festival couplets

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 32768/32768 K (Java/Others)

Description

When the spring festival is coming , people always paste spring festival couplets onto the wall.Now dandelion's father has bought several spring festival couplets, he wants to know how many pairs of spring festival couplets can been consisted with these spring festival couplets.As we know ,spring festival couplets are carefully balanced.Such as AABBCCDD can only be matched with AABBCCDD or BBDDEEFF or AABBAABB ...

Input

A number n stands for the number of the spring festival couplets.(2≤n≤110000)
Then n lines ,each line contains a string made by capital letters. Such as AABBCCDD,AABBCCD.The length of the string will not exceed 8.

Output

For every case ,print the number of pairs can be made by these spring festival couplets.

Sample Input

6 ABCCCDA LLLMNNO DEZZZBF AAABCCD KKKXPPQ AAA

Sample Output

4

Hint

yifenfei

Source

曾是惊鸿照影来

提交代码