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 <stdlib.h>

int min(int a, int b){
	return a <= b ? a : b;
}

int main(){
	int N, i, j;
	scanf("%d", &N);
	char **s = (char **)malloc(sizeof(char *) * N);
	int *L = (int *)malloc(sizeof(int) * N);
	for(i = 0; i < N; i++){
		s[i] = (char *)malloc(sizeof(char) * 11);
		scanf("%s", s[i]);
		for(j = 0; s[i][j] != '\0'; j++);
		L[i] = j;
	}
	int count = 0, A = 0, B = 0, B_A = 0;
	for(i = 0; i < N; i++){
		for(j = 1; j < L[i]; j++){
			if(s[i][j - 1] == 'A' && s[i][j] == 'B'){
				count++;
			}
		}
		if(s[i][0] == 'B'){
			B++;
		}
		if(s[i][L[i] - 1] == 'A'){
			A++;
		}
		if(s[i][0] == 'B' && s[i][L[i] - 1] == 'A'){
			B_A++;
		}
	}
	if(A != B){
		printf("%d\n", count + min(A, B));
	}
	else if(A == B_A){
		printf("%d\n", count + A - 1);
	}
	else{
		printf("%d\n", count + A);
	}
	return 0;
}