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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int acnt = 0,bcnt = 0,sum = 0;;
		for(int i = 0;i < n;i ++) {
			String s = sc.next();
			for(int k = 0;k < s.length()-1;k++) {
				if(s.charAt(k) == 'A' && s.charAt(k+1) == 'B') sum++;
			}
			if(s.charAt(0) == 'B') bcnt++;
			if(s.charAt(s.length()-1) == 'A') acnt++;
		}
		if(acnt + bcnt == n * 2) {acnt--; bcnt--;}
		if(Math.abs(acnt-bcnt) == 0) {
			sum += acnt;
		}else if(acnt < bcnt){
			sum += bcnt - Math.abs(acnt-bcnt);
		}else {
			sum += acnt - Math.abs(acnt-bcnt);
		}
		System.out.println(sum);
	}
}