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 count_ab(char *string) {
	int c = 0;
	while (*string != '\0') {
		if (*string == 'A' && *(string + 1) == 'B')
			c++;
		string++;
	}
	return c;
}

int main(int argc, char **args) {
	int n, tmp;
	int tail_a = 0;
	int head_b = 0;
	int answer = 0;
	char buff[1024];

	tmp = scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		tmp = scanf("%s", buff);
		if (buff[0] == 'B')
			head_b++;
		if (buff[strlen(buff) - 1] == 'A')
			tail_a++;
		answer += count_ab(buff);
	}

	printf("%d\n", answer += (head_b < tail_a ? head_b : tail_a));
	return 0;
}