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>
#include<stdlib.h>
#include<math.h>
#include<string.h>

//関数宣言
//int func(int x, int y);

int main(void){

  //スカラー入力
  int N;

  scanf("%d", &N);

  //配列入力
  char S[N][11];

  for(int i=0; i<N; i++){
      scanf("%s", S[i]);
  }

  int A=0, B=0, BA=0, AB=0;
  int flag;

  for(int i=0; i<N; i++){
    flag = 0;
    if(S[i][0] == 'B'){
      B++;
      flag = 1;
    }
    for(int j=1; j<11; j++){
      if(S[i][j] == 'B' && S[i][j-1] == 'A'){
        AB++;
      }
      if(S[i][j] == '\0' && S[i][j-1] == 'A'){
        A++;
        if(flag){
          BA++;
        }
      }
    }
  }

  if(A==BA && B==BA){
    printf("%d\n",AB+BA-1);
  }else if(A > B){
    printf("%d\n",AB+B);
  }else{
    printf("%d\n",AB+A);
  }

  //printf("%d %d %d %d\n", A,B,AB,BA);

  return 0;
}