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.*;

public class Main{
	public static void main(String[] args){
    	Scanner scan = new Scanner(System.in);
      	int n = scan.nextInt();
      	String[] arr = new String[n];
      	for (int i= 0; i < n; i ++){
        	arr[i] = scan.next();
        }
      	int countB = 0;
      	int countA = 0;
      	int countAB = 0;
      	for(int j = 0; j < n; j++){
         	if(arr[j].substring(arr[j].length()-1).contains("A")){
            	countA ++;
            }
			if(arr[j].substring(0,1).contains("B")){
            	countB ++;
            }
          	for(int k = 0;k < arr[j].length() -1; k ++){
            	if(arr[j].substring(k,k + 2).contains("AB")){
                	countAB ++;
                }
            }	
        }
      	int min = Math.min(countA, countB);
      	System.out.print(min + countAB);
      	
    }

}