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;

class Main {
    public static void main (String[] arg) {
        int N, K;
        int counter = 0;
        int endAcounter = 0;
        int startBconter = 0;
        String AB = "AB";
        String A = "A";
        String B = "B";
        String lookStr = "";

        Scanner scanner = new Scanner(System.in);
        N = scanner.nextInt();
        String[] strs = new String[N];

        for (int i = 0; i < N; i++) {
            lookStr = scanner.next();
            strs[i] = lookStr;
            if (lookStr.contains(AB)) {
                counter++;
            }
            if(lookStr.endsWith(A)) {
                endAcounter++;
            }
            if (lookStr.startsWith(B)) {
                startBconter++;
            }
        }
        scanner.close();

        counter += Math.min(endAcounter, startBconter);

        System.out.println(counter);
    } 
}