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
inpl = lambda: list(map(int,input().split()))
N = int(input())
ans = 0
BA  = [[0, 0], [0, 0]]
for i in range(N):
    s = input()
    ans += s.count('AB')
    h = 1 if s[0]=='B' else 0
    t = 1 if s[-1]=='A' else 0
    BA[h][t] += 1
if BA[1][0]==BA[0][1]==0 and BA[1][1]>0:
    ans += BA[1][1]-1
else:
    ans += min(BA[1][0],BA[0][1]) + BA[1][1]

print(ans)