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 main() {
	int i, j, k, n, t, m, b, h, w, r, g;
	int ab = 0, a1 = 0, b1 = 0;
	char s[15];
	int f = 0;
	h = 0;

	scanf("%d", &n);
	for (i = 0;i < n;i++) {
		scanf("%s", s);
		if (s[0] == 'B') {
			b1++;
		}
		for (j = 0;j < 12;j++) {
			if (s[j] == 'A') {
				if (s[j + 1] == 'B') {
					ab++;
				}
				else if (s[j + 1] == '\0') {
					a1++;
					break;
				}
			}
			else if (s[j] == '\0') {
				break;
			}
		}
	}
	
	if (a1 < b1) {
		f = ab + a1;
	}
	else if(a1 > b1){
		f = ab + b1;
	}
	else if (a1 == b1) {
		if (a1 == n) {
			f = ab + a1 - 1;
		}
		else {
			f = ab + a1;
		}
	}

	printf("%d",f);


	return 0;
}