Problem Statement

Snuke has N strings. The i-th string is s_i.
Let us concatenate these strings into one string after arranging them in some order.
Find the maximum possible number of occurrences of AB in the resulting string.

Input

Input is given from Standard Input in the following format:
N
s_1
$\vdots$
s_N

Output

Print the answer.

Constraints

• $1 \leq N \leq 10^{4}$
• $2 \leq |s_i| \leq 10$
• s_i consists of uppercase English letters.

Sample Input 1

3
ABCA
XBAZ
BAD

Sample Output 1

2

For example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.

Sample Input 2

9
BEWPVCRWH
ZZNQYIJX
BAVREA
PA
HJMYITEOX
BCJHMRMNK
BP
QVFABZ
PRGKSPUNA

Sample Output 2

4

Sample Input 3

7
RABYBBE
JOZ
BMHQUVA
BPA
ISU
MCMABAOBHZ
SZMEHMA

Sample Output 3

4

见题面 Input 部分

见题面 Output 部分