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 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
int min(int a, int b){
    if(a<b){
        return a;
    }
    else{
        return b;
    }
}
int main(){
    int N, cnt=0, afin=0, bsta=0, j, doub=0, tmp=0;
    scanf("%d", &N);
    for(int i=0;i<N;i++){
        char s[11];
        scanf("%s", s);
        if(s[0]=='B'){
            bsta += 1;
        }
        for(j=0;s[j]!=0;j++){
            if(s[j]=='A'){
                if(s[j+1]=='B'){
                    cnt += 1;
                }
            }
        }
        if(s[j-1]=='A'){
            if(s[0] == 'B'){
                bsta -= 1;
                doub += 1;
            }
            else{
            afin +=1;
            }
        }
    }
    printf("%d\n", cnt + min(min(afin+doub, bsta), min(afin, doub+bsta)));
    return 0;
}