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.

Constraints

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

Input

Input is given from Standard Input in the following format:


N
s_1
\vdots
s_N


Output

Print the answer.

Examples

Input

3
ABCA
XBAZ
BAD


Output

2


Input

9
BEWPVCRWH
ZZNQYIJX
BAVREA
PA
HJMYITEOX
BCJHMRMNK
BP
QVFABZ
PRGKSPUNA


Output

4


Input

7
RABYBBE
JOZ
BMHQUVA
BPA
ISU
MCMABAOBHZ
SZMEHMA


Output

4
N = int(input())
T, c1, c2, c3 = 0, 0, 0, 0
for i in range(N):
    S = input()
    T += S.count('AB')
    if S[0] == 'B' and S[-1] == 'A':
        c1 += 1
    elif S[-1] == 'A':
        c2 += 1
    elif S[0] == 'B':
        c3 += 1
if c2 == 0 and c3 == 0:
    print(T + max(c1 - 1, 0))
else:
    print(T + c1 + min(c2, c3))