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: Wrong Answer)

parseInt(x)=parse(Int,x)
parseMap(x::Array{SubString{String},1})=map(parseInt,x)

function main()
	n = readline() |> parseInt
	s = ["" for i in 1:n]
	for i in 1:n
		s[i] = chomp(readline())
	end
	k = 0
	h = 0
	t = 0
	b = 0
	for i in 1:n
		l = length(s[i])
		for j in 2:l
			if s[i][j-1] == 'A' && s[i][j] == 'B'
				k += 1
			end
		end
		if s[i][1] == 'B' && s[i][l] == 'A'
			b += 1
		elseif s[i][1] == 'B'
			h += 1
		elseif s[i][l] == 'A'
			t += 1
		end
	end
	if h+b>t||b+t>h
		k += max(min(h+b,t),min(h,b+t))+max(b-1,0)
	elseif h+b<=t
		k += h+b
	elseif b+t<=h
		k += b+t
	end
	println(k)
end
main()