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

n=gets.chomp.to_i
s=Array.new
count=0
a,b,ab=0,0,0

for i in 0..n-1
  s[i]=gets.chomp
  count+=s[i].scan(/AB/).size

  if s[i][s[i].size-1]=="A" && s[i][0]=="B"
    ab+=1
  elsif s[i][0]=="B"
    b+=1
  elsif s[i][s[i].size-1]=="A"
    a+=1
  end
end

if ab>0 && a>0
  a-=1
  count+=1
end

if ab>0 && b>0
  b-=0
  count+=1
end

if ab>0
  ab-=1
end

puts count+[a,b].min+ab