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