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(raw_input())

inner_ab_count = 0
f_b_count = 0
l_a_count = 0
b_a_count = 0

for n in xrange(N):
    s = raw_input()
    inner_ab_count += s.count('AB')
    if s[0] == 'B':
        if s[-1] == 'A': b_a_count += 1
        else: f_b_count += 1
    elif s[-1] == 'A': l_a_count += 1

if b_a_count <= 0: result = inner_ab_count + min([l_a_count, f_b_count])
elif l_a_count + f_b_count == 0: result = inner_ab_count + b_a_count-1
else: result = inner_ab_count + b_a_count + min([l_a_count,f_b_count])
print result