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,ct=0,i,j;
  int cta=0,ctb=0,ctba = 0,l,f;
  char s[11];
  scanf("%d",&N);
  for(i = 0;i <N;i++){
    scanf("%s",s);
    l = strlen(s);
    f = 0;
    for(j = 0;j < l;j++){
      if(f == 1&&s[j]=='B'){ct++;}f = 0;
      if(s[j] == 'A'){f = 1;}
    }if(s[0] == 'B'){ctb++;}if(s[l-1] == 'A'){cta++;}
    if(s[0] == 'B'&&s[l-1]=='A'){ctba++;}
  }
  ct += (cta > ctb ? ctb:cta);
  if(ctba == ctb&&ctba == cta){ct--;}
  printf("%d\n",ct);
  return 0;
}