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>

int min(int a, int b){
	if(a>b){
		return b;
	}
	return a;
}

int main(){
	int N;
	char s[10001][12];
	char dm;
	scanf("%d",&N);
	scanf("%c",&dm);
	int i;
	int j;
	i=1;
	j=1;
	while(i<=N){
		int e;
		e=0;
		while(e==0){
			scanf("%c",&s[i][j]);
			if(s[i][j]=='\n'||j>=10){
				i=i+1;
				e=1;
				j=1;
			}
			if(e==0){
				j=j+1;
			}
		}
	}
	int a;
	a=0;
	int ans;
	ans=0;
	int f;
	f=0;
	int b;
	b=0;
	for(i=1;i<=N;i++){
		if(s[i][1]=='B'){
			f=f+1;
		}
		for(j=1;j<=10;j++){
			if(s[i][j]=='A'&&s[i][j+1]=='B'){
				a=a+1;
			}
			if(s[i][j]=='A'&&s[i][j+1]=='\n'){
				b=b+1;
			}
		}
		ans=ans+a;
		a=0;
	}
	ans=ans+min(f,b);
	if(f-b==0){
		ans=ans-1;
	}
	printf("%d",ans);
}