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 max(int a,int b,int n){
	if(a == n && b == n && a > 0 && b > 0) return a - 1;
	if(a > b) return b;
	else return a;
}

int main()
{
	int sums = 0,suma = 0,sumb = 0;
	int n;
	char c[10005][11];
	scanf("%d",&n);
	for(int i = 0;i < n;i++){
		scanf("%s",c[i]);
		for(int j = 0;j < strlen(c[i]) - 1;j++){
			if(c[i][j] == 'A' && c[i][j + 1] == 'B') sums++;
		}
		if(c[i][0] == 'B') sumb++;
		if(c[i][strlen(c[i]) - 1] == 'A') suma++;
	}
	sums += max(suma,sumb,n);
	printf("%d",sums);
	return 0;
}