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 9.2.1) (judge verdict: Wrong Answer)

#include <stdio.h>

int main(void) {
	int N;
	int i;
	int a = 0, b = 0, ab = 0, ba = 0;
	int kitaeri;
	if (scanf("%d", &N) != 1) return 1;
	for (i = 0; i < N; i++) {
		char s[16];
		int j;
		if (scanf("%15s", s) != 1) return 1;
		if (s[0] == 'B') b++;
		for (j = 0; s[j] != '\0'; j++) {
			if (s[j] == 'A' && s[j + 1] == 'B') ab++;
			if (s[j] == 'A' && s[j + 1] == '\0') {
				a++;
				if (s[0] == 'B') ba++;
			}
		}
	}
	kitaeri = a <= b ? a : b;
	printf("%d\n", ab + (kitaeri == ba ? kitaeri - 1 : kitaeri));
	return 0;
}