{"raw_statement":[{"iden":"problem statement","content":"We will call a string obtained by arranging the characters contained in a string $a$ in some order, an _anagram_ of $a$.\nFor example, `greenbin` is an anagram of `beginner`. As seen here, when the same character occurs multiple times, that character must be used that number of times.\nGiven are $N$ strings $s_1, s_2, \\ldots, s_N$. Each of these strings has a length of $10$ and consists of lowercase English characters. Additionally, all of these strings are distinct. Find the number of pairs of integers $i, j$ $(1 \\leq i < j \\leq N)$ such that $s_i$ is an anagram of $s_j$."},{"iden":"constraints","content":"*   $2 \\leq N \\leq 10^5$\n*   $s_i$ is a string of length $10$.\n*   Each character in $s_i$ is a lowercase English letter.\n*   $s_1, s_2, \\ldots, s_N$ are all distinct."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$s_1$\n$s_2$\n$:$\n$s_N$"},{"iden":"sample input 1","content":"3\nacornistnt\npeanutbomb\nconstraint"},{"iden":"sample output 1","content":"1\n\n$s_1 =$ `acornistnt` is an anagram of $s_3 =$ `constraint`. There are no other pairs $i, j$ such that $s_i$ is an anagram of $s_j$, so the answer is $1$."},{"iden":"sample input 2","content":"2\noneplustwo\nninemodsix"},{"iden":"sample output 2","content":"0\n\nIf there is no pair $i, j$ such that $s_i$ is an anagram of $s_j$, print $0$."},{"iden":"sample input 3","content":"5\nabaaaaaaaa\noneplustwo\naaaaaaaaba\ntwoplusone\naaaabaaaaa"},{"iden":"sample output 3","content":"4\n\nNote that the answer may not fit into a $32$\\-bit integer type, though we cannot put such a case here."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}