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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

namespace inonoa{
    class Ino{
        static void Main(){
            int n = int.Parse(System.Console.ReadLine());
            int ans = 0;
            int a = 0;
            int b=0;
            int ab = 0;
            for(int i=0;i<n;i++){
                char[] si = System.Console.ReadLine().ToCharArray();
                if(si[0]=='B'){b++;}
                if(si[si.Length-1]=='A'){a++;}
                if(si[0]=='B'&&si[si.Length-1]=='A'){ab++;}
                for(int j=0;j<si.Length-1;j++){
                    if(si[j]=='A'&&si[j+1]=='B'){ans++;}
                }
            }
            if(ab==a && ab==b && ab!=0){a--;b--;}
            if(a==n){a--;}
            if(b==n){b--;}
            if(a>b){ans += b;}
            else{ans += a;}
            System.Console.WriteLine(ans);

        }
    }
}