{"raw_statement":[{"iden":"problem statement","content":"Takahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\nThe problem has $N$ test cases.\nFor each test case $i$ ($1\\leq i \\leq N$), you are given a string $S_i$ representing the verdict for that test case. Find the numbers of test cases for which the verdict is `AC`, `WA`, `TLE`, and `RE`, respectively.\nSee the Output section for the output format."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 10^5$\n*   $S_i$ is `AC`, `WA`, `TLE`, or `RE`."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$S_1$\n$\\vdots$\n$S_N$"},{"iden":"sample input 1","content":"6\nAC\nTLE\nAC\nAC\nWA\nTLE"},{"iden":"sample output 1","content":"AC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have $3$, $1$, $2$, and $0$ test case(s) for which the verdict is `AC`, `WA`, `TLE`, and `RE`, respectively."},{"iden":"sample input 2","content":"10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC"},{"iden":"sample output 2","content":"AC x 10\nWA x 0\nTLE x 0\nRE x 0"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}