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>
#include<math.h>
#include<stdbool.h>




int main() {
	char s[10011][11];
	int n,cnt=0,cnta=0,cntb=0,m[10011],flag=0;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%s", s[i]);
		for (int j = 0; s[i][j] != '\0'; j++) {
			if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
				cnt++;
				s[i][j] = 'C';
				s[i][j + 1] = 'C';
			}
			if (s[i][j + 1] == '\0')m[i] = j;
			
		}
	}
	for (int i = 0; i < n; i++) {
		
		
		if (s[i][0] == 'B' && s[i][m[i]] == 'A')flag++;
		else if (s[i][0] == 'B')cntb++;
		else if (s[i][m[i]] == 'A')cnta++;
	}
	if (flag != 0 ) {
		if (cnta != 0 && cntb != 0) {
			cnt += flag + 1;
			cnta--; cntb--;
		}
		else if (cntb != 0 || cnta != 0)cnt += flag;
		else cnt += flag - 1;
		
	}
	if (cnta > cntb)printf("%d", cnt + cntb);
	else printf("%d", cnt + cnta);
	return 0;
}