시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
1 초 | 32 MB | 233 | 200 | 188 | 91.707% |
After a few months of playing on his new phone, Mirko has finally decided to find a new hobby. He discovered a card game called bridge!
It is known that bridge is played by four players using a 52-card deck, 4 suits total (clubs, hearts, diamonds and spades) and 13 values (A, K, Q, J, 10, 9, 8, 7, 6, 5, 4, 3 and 2). At the beginning of the game, each player is dealt 13 cards.
Before starting the game, each player counts their so-called honor points in the following way:
Given the fact that Mirko has started playing bridge only recently, he has decided to practice couting points. He dealt himself cards N times and each time counted his honor points. In the end, he added them up.
He wants to know if he’s done a good job. Help Mirko and check!
The first line of input contains the integer N (1 ≤ N ≤ 10 000) from the task.
Each of the following N lines contains Ki , a string consisting of characters ‘A’, ‘K’, ‘Q’, ‘J’, ‘X’, of length 13, representing the cards Mirko had in his hand after dealing them for the ith time.
The first and only line of output must contain the required sum from the task. SAMPLE TES
1 AKXAKJXXXAXAQ
25
4 XXXAXXXXXXJXX KXAXXXQJAXXXX AQKQXXXKXXKQX JXXXXXJXXXXXX
40
Clarification of the example : Mirko has a total of 4 aces, 2 kings, 1 queen and 1 jack in his hand. This totals to 4 * 4 + 2 * 3 + 1 * 2 + 1 * 1 = 25 honor points.