{"raw_statement":[{"iden":"problem statement","content":"Limak can repeatedly remove one of the first two characters of a string, for example $abcxyx \\rightarrow acxyx \\rightarrow cxyx \\rightarrow cyx$.\nYou are given $N$ different strings $S_1, S_2, \\ldots, S_N$. Among $N \\cdot (N-1) / 2$ pairs $(S_i, S_j)$, in how many pairs could Limak obtain one string from the other?"},{"iden":"constraints","content":"*   $2 \\leq N \\leq 200\\,000$\n*   $S_i$ consists of lowercase English letters `a`\\-`z`.\n*   $S_i \\neq S_j$\n*   $1 \\leq |S_i|$\n*   $|S_1| + |S_2| + \\ldots + |S_N| \\leq 10^6$"},{"iden":"input","content":"Input is given from Standard Input in the following format.\n\n$N$\n$S_1$\n$S_2$\n$\\vdots$\n$S_N$"},{"iden":"sample input 1","content":"3\nabcxyx\ncyx\nabc"},{"iden":"sample output 1","content":"1\n\nThe only good pair is $(abcxyx, cyx)$."},{"iden":"sample input 2","content":"6\nb\na\nabc\nc\nd\nab"},{"iden":"sample output 2","content":"5\n\nThere are five good pairs: $(b, abc)$, $(a, abc)$, $(abc, c)$, $(b, ab)$, $(a, ab)$."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}