Score : 200 points
Takahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.
The problem has N test cases.
For 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.
See the Output section for the output format.
AC
, WA
, TLE
, or RE
.Input is given from Standard Input in the following format:
N S_1 \vdots S_N
Let C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC
, WA
, TLE
, and RE
, respectively. Print the following:
AC x C_0 WA x C_1 TLE x C_2 RE x C_3
6 AC TLE AC AC WA TLE
AC x 3 WA x 1 TLE x 2 RE x 0
We have 3, 1, 2, and 0 test case(s) for which the verdict is AC
, WA
, TLE
, and RE
, respectively.
10 AC AC AC AC AC AC AC AC AC AC
AC x 10 WA x 0 TLE x 0 RE x 0