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())
S = [input() for x in range(N)]

a = b = ab = t = 0
for s in S:
	if s[0] == "B" and s[-1] == "A":
		ab += 1
	elif s[0] == "B":
		b += 1
	elif s[-1] == "A":
		a += 1
	t += s.count("AB")
	#3
t += max(0,ab - 1)
if ab > 0:
	#2
	if a > 0:
		t += 1
		a -= 1
	if b > 0:
		t += 1
		b -= 1
#1
t += min(a,b)
print(t)