1093 : String Commutativity

时间限制Time Limit 1 Sec 内存限制Memory Limit 128 MB 提交次数Submitted 450 Times 通过次数Solved 140 Times 标准评测Standard Judge

题目描述Description

Bobo has n strings s1, ..., sn, and he would like to find the number of pairs i < j where si + sj = sj + si.

Note that a + b means the concatenation of the string a and b, i.e., writing the string a first, and the string b second.

输入格式Input

The input consists of several test cases terminated by end-of-file.

The first line of each test case contains an integer n. The i-th of the following n lines contains a string si.

  • 1 ≤ n ≤ 105
  • |si| ≤ 106si contains only lower case characters.
  • The sum of strings does not exceed 5 × 106.

输出格式Output

For each test case, print an integer which denotes the result.

样例Sample

出题Author

ftiasch