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: Runtime Error)

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		String[] s = new String[N];
		for(int i = 0;i < N;i++) {
			s[i] = sc.next();
		}
		sc.close();

		int cnt = 0;
		int lastA = 0;
		int firstB = 0;
		int lastA_And_firstB = 0;
		for(int i = 0;i < N;i++) {
			for(int j = 0;j < s[i].length()-1;j++) {
				if(s[i].substring(j,j+2).equals("AB")) {
					cnt++;
				}
			}
		}
		for(int i = 0;i < s[i].length();i++) {
			if(s[i].startsWith("B") && s[i].endsWith("A")) {
				lastA_And_firstB++;
			}else if(s[i].startsWith("B") && !s[i].endsWith("A")) {
				firstB++;
			}else if(!s[i].startsWith("B") && s[i].endsWith("A")) {
				lastA++;
			}
		}
		if(lastA_And_firstB == 0) {
			cnt += Math.min(lastA, firstB);
		}else{
			if(lastA + firstB > 0) {
				cnt += lastA_And_firstB + Math.min(lastA, firstB);
			}else {
				cnt += lastA_And_firstB - 1;
			}
		}
		System.out.println(cnt);
	}
}