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 (Clang 3.8.0) (judge verdict: Runtime Error)

#include <stdio.h>

int main(){
  	int N, ans = 0, len = 0, A_num = 0, B_num = 0, calc;
  	char s[1000][11];
  
  	scanf("%d\n",&N);
  	for(int i = 0; i < N; i++){
    	scanf("%s\n",s[i]);
      	len = 0;
      	for(int j = 0; j < 10; j++){
        	if(s[i][j] == 'A' && s[i][j+1] == 'B'){
              	//printf("%s\n",s[i]);
            	ans++;
            }
          	if('A' <= s[i][j] && s[i][j] <= 'Z'){
            	len++;
            }
        }
      	if(s[i][0] == 'B' && s[i][len-1] == 'A'){
        	A_num++;
          	B_num++;
          	//printf("%s\n",s[i]);
        }else if(s[i][0] == 'B'){
        	B_num++;
        }else if(s[i][len-1] == 'A'){
        	A_num++;
        }
        //printf("%s\n",s[i]);
    }
  
  	if(A_num >= B_num){
    	calc = B_num;
    }else{
    	calc = A_num;
    }
  	ans += calc;
  
  	printf("%d\n",ans);
	return 0;
}