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,acount=0,bcount=0,maxcount=0,newN=0,len;
  scanf("%d",&N);
  char s[N][10],news[N][10];
  for(i=0;i<N;i++){
    scanf("%s",s[i]);
    char *hoge;
    hoge=s[i];
    while(1){
      if((hoge=strstr(hoge,"AB"))!=NULL){
	maxcount++;
	hoge++;
      }
      else{
	break;
      }
    }
    len=strlen(s[i]);
    if(s[i][0]=='B'){
      bcount++;
    }
    if(s[i][len-1]=='A'){
      acount++;
    }
    /*
    if(s[i][0]=='A'||s[i][0]=='B'||s[i][len-1]=='A'||s[i][len-1]=='B'){
      news[newN][0]=s[i][0];
      news[newN][1]=s[i][len-1];
      news[newN][2]='\0';
      newN++;
    }
    */
  }
  /*
  for(i=0;i<newN;i++){
    printf("%s\n",news[i]);
  }
  */
  /*  
  for(i=0;i<N;i++){
    printf("%s\n",s[i]);
  }
  */
  if(acount<bcount){
    maxcount+=acount;
  }
  else{
    maxcount+=bcount;
  }
  printf("%d\n",maxcount);
  return 0;
}