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++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;

int compare_char(char *a,char *b){
	return strcmp(a,b);
}

int intsort(const void *a, const void *b){
	return *(int*)b - *(int*)a;
	/*qsort(a,aの配列数,sizeof(int),intsort);*/
}

int longsort(const void *a, const void *b){
	long *A=(long *)a;
	long *B=(long *)b;
	if(*A>*B) return -1;
	if(*A<*B) return 1;
	return 0;
}

int main(){
  int i,j,len,N,cnt=0,fcnt=-1,lcnt=0,f;
  char ss[20];
  scanf("%d",&N);
  for(i=0;i<N;i++){
    scanf("%s",ss);
    len=strlen(ss);
    if(ss[0]=='B')fcnt++;
    if(ss[len-1]=='A')lcnt++;
    f=0;
    for(j=0;j<len;j++){
      if(f==1&&ss[j]=='B'){
        cnt++;
        f=0;
      }else if(ss[j]=='A'){
        f=1;
      }else{
        f=0;
      }
    }
  }
  if(fcnt<0)fcnt=0;
  if(fcnt<lcnt+1)fcnt++;
  printf("%d\n",cnt+min(fcnt,lcnt));
  return 0;
}