AT_abc413_b [ABC413B] cat 2

You are given $ N $ types of strings $ S_1,S_2,\ldots,S_N $ . You perform the following operation once: - Choose **distinct** integers $ i $ and $ j\ (1\le i\le N,1\le j\le N) $ and concatenate $ S_i $ and $ S_j $ in this order. How many different strings can be obtained as a result of this operation? If different choices of $ (i,j) $ result in the same concatenated string, it is counted as one string.

The input is given from standard input in the following format: > $ N $ $ S_1 $ $ S_2 $ $ \vdots $ $ S_N $

Print the number of different strings that can be obtained from the operation.

### Sample Explanation 1 The possible strings are `atatco`, `atcoat`, `atcoder`, `atcocoder`, `atder`, `coderat`, `coderatco`, `coderder`, `derat`, `deratco`, `dercoder`, which are $ 11 $ strings. Thus, print `11`. ### Sample Explanation 2 The possible strings are `aaa`, `aaaa`, `aaaaa`, `aaaaaa`, `aaaaaaa`, `aaaaaaaa`, `aaaaaaaaa`, which are $ 7 $ strings. Thus, print `7`. ### Constraints - $ 2\le N\le100 $ - $ N $ is an integer. - $ S_i $ is a string of length between $ 1 $ and $ 10 $ , inclusive, consisting of lowercase English letters. - $ S_i\ne S_j\ (1\le i\lt j\le N) $