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();
		String[] s = new String[n];
//		boolean[] biginB = new boolean[n];
//		boolean[] endA = new boolean[n];
		int endA = 0;
		int biginB = 0;
		int endAbiginB = 0;
		int inAns =0;

		for (int i=0;i<n; i++) {
			s[i] = sc.next();
			for (int j=0;j<s[i].length()-2;j++) {
				if (s[i].charAt(j)=='A' && s[i].charAt(j+1)=='B') {
					inAns++;
				}
			}

			if (s[i].charAt(s[i].length()-1)=='A' && s[i].charAt(0)=='B') {
				endAbiginB ++;
			} else if (s[i].charAt(s[i].length()-1)=='A') {
				endA ++;
			} else if(s[i].charAt(0)=='B') {
				biginB ++;
			}
		}

		int diff = Math.abs(endA - biginB);
		int subans = Math.min(endA, biginB);
		if (endAbiginB >= diff) {
			subans = subans + diff+ (endAbiginB-diff) % 2;
		}

//		System.out.println("subans:"+subans+" inans:"+inAns);
		System.out.println(subans+inAns);
	}
}