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
s_list = []

start_b = 0
end_a = 0
both = 0

count = 0
N.times{
	s = gets.strip
	s_list << s
	s.scan(/AB/){
		count += 1
	}
	if s[0] == "B"
		if s[-1] == "A"
			both += 1
		else
			start_b += 1
		end
	elsif s[-1] == "A"
		end_a += 1
	end
}

if both >= 1
	count += (both - 1)
	if start_b > 0
		count += 1
		start_b -= 1
	end
	if end_a > 0
		count += 1
		end_a -= 1
	end
end

count += [start_b, end_a].min

puts count