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>
#include<string.h>
int main(){
    int n,i,j,b=0,e=0,r=0;
    char s[10000][11];
    char *p;
    scanf("%d",&n);
    for(i=n;i--;){
        scanf("%s",s[i]);
        b+=s[i][0]=='B';
        for(j=2;s[i][j]!='\0';j++);
        e+=s[i][j-1]=='A';
        do{
            p=strstr(s[i],"AB");
            if(p!=NULL){*p='C';r++;}
        }while(p!=NULL);
    }
    b-=b==n;
    e-=e==n;
    r+=b<e?b:e;
    printf("%d",r);
    return 0;
}