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 sc = new Scanner(System.in);
        // 整数の入力
		int n = sc.nextInt();
        //配列の宣言
        String str;
        int ans = 0;
        int a = 0;
        int b = 0;
        int e = 0;
        //for文
        for(int i = 0; i < n; i++){
            str = sc.next();
            if(str.charAt(str.length()-1) == 'A') a++;
            if(str.charAt(0) == 'B') b++;
            if(str.charAt(str.length()-1) == 'A' && str.charAt(0) == 'B') e++;
            while(str.contains("AB")){
                ans++;
                str = str.substring(str.indexOf("AB") + 2, str.length());
            }
        }
        if(a == e && b == e) e = 1;
        else e = 0;
        // 出力
        System.out.println(ans + Math.min(a, b) - e);

    }

}