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 main(void) {
	int n;
	int bx = 0;
	int xa = 0;
	int ba = 0;
	char s[11];
	int i;
	int res = 0;
	scanf("%d",&n);
	while(n--){
		scanf("%s",s);
		for(i=0;i<strlen(s)-1;i++)
			if(s[i]=='A' && s[i+1]=='B')
				res++;
		
		if(s[0]=='B'&&s[strlen(s)-1]=='A')
			ba++;
		else if(s[0]=='B')
			bx++;
		else if(s[strlen(s)-1]=='A')
			xa++;
	}
	
	int rest = 0;
	if(bx<xa){
		rest = xa - bx;
		res += bx;
	}
	else{
		rest = bx - xa;
		res += xa;
	}
	
	res += ba;
	if(rest==0&&ba>0)
	res--;
	
	printf("%d\n",res);
		
		
		
	
	// your code goes here
	return 0;
}