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 count;
        count = 0;

        String NString = sc.next();
        int N;
        N = Integer.parseInt(NString);

        int a = 0;
        int b = 0;
        int c = 0;

        for (int i = 1; i <= N; i++) {
            String moji = sc.next();

            String first = moji.substring(0, 1);
            String end = moji.substring(moji.length() - 1);

            if (moji.contains("AB")) {
                count = count + 1;
            }

            if (first.equals("B")) {
                b = b + 1;
            }
            if (end.equals("A")) {
                a = a + 1;
            }
            if (end.equals("A") && first.equals("B")) {
                c = c + 1;
            }
        }

        int min = Math.min(a, b);
        count = count + min - c;

        System.out.println(count);
    }
}