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: Accepted)

#include <stdio.h>
#include <string.h>

int min(int a,int b){
  if(a < b){
    return a;
  }
  return b;
}

int main(void){
  int N;
  scanf("%d",&N);

  char s[10];
  int ans = 0;
  int firstB = 0,endA = 0,both = 0;
  for (int i = 0; i < N; i++) {
    scanf("%s",s);
    int flag = 0;
    if(s[0] == 'B' && s[strlen(s)-1] == 'A') both++;
    else if(s[0] == 'B') firstB++;
    else if(s[strlen(s)-1] == 'A') endA++;
    for (int j = 0; j < strlen(s); j++) {
      if(s[j] == 'A') flag = 1;
      else if(flag == 1 && s[j] == 'B'){
        ans++;
        flag = 0;
      }else flag = 0;
    }
  }

  if(both == 0) ans += min(firstB,endA);
  else{
    if(firstB+endA > 0) ans += both+min(firstB,endA);
    else ans += both-1;
  }

  printf("%d\n",ans);

  return 0;
}