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 Ruby (2.3.3) (judge verdict: Accepted)

n=gets.to_i
ab_count=0
b_front=0
a_tail=0
bf_at=0
n.times do|i|
	str=gets.chomp
	ab_count+=str.scan("AB").length
	if(str[str.length-1]=="A")
		if(str[0]=="B")
			bf_at+=1	
		else
			a_tail+=1
		end
	elsif(str[0]=="B")
		b_front+=1
	end
end
flag=false
if(bf_at>0 and a_tail>0)
	bf_at-=1
	a_tail-=1
	ab_count+=1
	ab_count+=bf_at
	flag=true
else
	if(bf_at>0)
		ab_count+=(bf_at-1)
		flag=true
	end
end
if(flag and b_front>0)
	ab_count+=1
	b_front-=1
end
if a_tail>b_front
	ab_count+=b_front
else
	ab_count+=a_tail
end
puts ab_count