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.io.InputStream;
import java.io.PrintStream;
import java.util.*;

public class Main {

  public static void main(String[] args) {
    solve(System.in, System.out);
  }

  static void solve(InputStream is, PrintStream os) {
    Scanner sc = new Scanner(is);

    /* read */
    int N = sc.nextInt();
    int count = 0;
    int aEnd = 0;
    int bStart = 0;
    List<String> strings = new ArrayList<>();
    for (int i = 0; i < N; i++) {
      String s = sc.next();
      strings.add(s);
      
      boolean flag = false;
      for (int j = 0; j < s.length(); j++) {
        if (s.charAt(j) == 'B' && flag) {
          count++;
          flag = false;
        } else if (s.charAt(j) == 'A') {
          flag = true;
        } else {
          flag = false;
        }
      }
      if (s.charAt(0) == 'B') {
        bStart++;
      }
      if (s.charAt(s.length() - 1) == 'A') {
        aEnd++;
      }
    }
    
    if (aEnd == bStart && aEnd == N) {
      count += N - 1;
    } else {
      count += Math.min(aEnd, bStart);
    }

    os.println(count);
  }


}