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())
ans = 0
g = [0,0,0]

for i in range(N):
    S = input()
    if 'AB' in S:
        ans += S.count('AB')
    if S[0] == 'B' and S[-1] == 'A':
        g[0] += 1
    elif S[0] == 'B':
        g[1] += 1
    elif S[-1] == 'A':
        g[2] += 1

if g[1]==0 and g[2]==0 and g[0]!=0:
    ans += g[0] - 1
else:
    ans += min(g[1],g[2]) + g[0]

print(ans)