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: Accepted)

#include <stdio.h>
#include <string.h>
int min(int x, int y) {
	return x < y ? x : y;
}
int main() {
	int n;
	char s[10001][11];
	int ac = 0, bc = 0, abc = 0;
	int ans = 0;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%s", s[i]);
		int l = strlen(s[i]);
		if (s[i][l - 1] == 'A' && s[i][0] == 'B') {
			abc++;
		} else if (s[i][l - 1] == 'A') {
			ac++;
		} else if (s[i][0] == 'B') {
			bc++;
		}
		for (int j = 0; j < l - 1; j++) {
			if (s[i][j] == 'A' && s[i][j + 1] == 'B')
				ans++;
		}
	}
	if (abc == 0) {
		ans += min(ac, bc);
	} else {
		if (ac == 0 && bc == 0) {
			ans += abc - 1;
		} else {
			ans += abc + min(ac, bc);
		}
	}
	printf("%d\n", ans);
	return 0;
}