Problem:
Score : 400 points

Problem Statement

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.

Sample Input 1

3
ABCA
XBAZ
BAD

Sample Output 1

2

For example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.

Sample Input 2

9
BEWPVCRWH
ZZNQYIJX
BAVREA
PA
HJMYITEOX
BCJHMRMNK
BP
QVFABZ
PRGKSPUNA

Sample Output 2

4

Sample Input 3

7
RABYBBE
JOZ
BMHQUVA
BPA
ISU
MCMABAOBHZ
SZMEHMA

Sample Output 3

4

Solution in Julia (0.5.0) (judge verdict: Accepted)

function main()
	N=parse(Int,readline())
	ca=cb=cab=0
	ans=0
	for _=1:N
		s=chomp(readline())
		n=length(s)
		for i=2:n
			if s[i-1]=='A'&&s[i]=='B'
				ans+=1
			end
		end
		if s[1]=='B'
			cb+=1
			if s[end]=='A'
				cab+=1
			end
		end
		if s[end]=='A'
			ca+=1
		end
	end
	println(ans+min(ca,cb)-(ca==cb==cab>0 ? 1 : 0))
end
main()