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 C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>

int main(int argc, char const *argv[]) {
  int N,count=0,countA=0,countB=0,i;
  char array[12];
  scanf("%d", &N);
  while (N > 0) {
    scanf("%s",array);
    for (i = 0; array[i+1] != '\0'; i++) {
      if (array[i] == 'A') {
        if (array[i+1] == 'B') {
          count++;
        }
      }
    }
    if (array[0] == 'B') {
      countB++;
    }
    if (array[i] == 'A') {
      countA++;
    }
    for (i = 0; array[i] != '\0'; i++) {
      array[i] = '\0';
    }
    N--;
  }
  if (countA > countB) {
    count += countB;
  } else {
    count += countA;
  }
  printf("%d\n",count);
  return 0;
}