Description

Mirko invented a card game. The cards only include $\text{A, K, Q, J}$ and $\text{X}$. Their scores are $4, 3, 2, 1, 0$, respectively.

Given $N$ decks, each containing $13$ cards, find the total score of all cards in these $N$ decks.

Input Format

The first line contains an integer $N$.

The next $N$ lines each contain a string $K_i$ of length $13$. The string only contains the characters $\text{A, K, Q, J, X}$.

Output Format

Output the total score of all cards.

1
AKXAKJXXXAXAQ

25

4
XXXAXXXXXXJXX
KXAXXXQJAXXXX
AQKQXXXKXXKQX
JXXXXXJXXXXXX

40

Hint

[Sample 1 Explanation]

Therefore, the total score is $16+6+2+1+0=25$.

[Constraints]

For $100\%$ of the testdata, $1 \le N \le 10^4$.

[Notes]

This problem is translated from COCI 2016-2017 CONTEST #4 T1 Bridž.

The scoring of this problem follows the original COCI problem settings, with a full score of $50$.

Translated by ChatGPT 5