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=0,j=0,count=0,l=0,a=0,b=0,c=0,d=0,ans=0;
    char S[10000][10] ;
    scanf("%d",&N);
    for(i=0;i<N;i++)
    {
        scanf("%s",S[i]);
    }
    for(i=0;i<N;i++)
    {
        l=strlen(S[i]);
        for(j=0;j<l-1;j++)
    {
        if(S[i][j]=='A' && S[i][j+1]=='B')
        {
            count++;
        }
    }
    }
    for(i=0;i<N;i++)
    {
        l=strlen(S[i]);
         if(S[i][0]=='A' || S[i][l-1]=='A')
         {
             a++;
         }
         if(S[i][0]=='B' || S[i][l-1]=='B')
         {
             b++;
         }
         if(S[i][0]=='A' && S[l-1]=='B')
         {
             c++;
         }
         if(S[i][0]=='B' && S[l-1]=='A')
         {
             c++;
         }

    }
    if(a<b)
    {
        d=a;
    }
    else
    {
        d=b;
    }
    ans=count+d-c ;
  printf("%d\n",ans);

return 0;
}