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<math.h>
int main(void){
	int N;
	char s[10000][11];
	unsigned long int Ans=0;
	unsigned long int A=0;
	unsigned long int B=0;
	unsigned long int BA=0;
	int i,j;
	for(i=0;i<10000;i++){
		for(j=0;j<11;j++){
			s[i][j]=0;
		}
	}
	scanf("%d",&N);
	
	for(i=0;i<N;i++){
		scanf("%s",s[i]);
	}
	for(i=0;i<N;i++){
		if(s[i][0]=='B') B++;
		for(j=0;j<9;j++){
			if(s[i][j]=='A' && s[i][j+1]=='B'){
				Ans++;
			}
			if(s[i][j+1]==0){
				if(s[i][j]=='A'){
					A++;
					if(s[i][0]=='B'){
						BA++;
					}
				}
				break;
			}
			
		}
	}
	
	if(BA==A && BA==B){
		printf("%d",Ans+BA-1);
	}
	if(B>A){
		printf("%d",Ans+A);
	}else{
		printf("%d",Ans+B);
	}
	
	
    return 0;
}