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


int main (){
    
 char a[10000][255];
  int n,count,A,B,ans;
  
  count = A = B = 0;
  
  scanf("%d",&n);
  for(int i = 0;i < n;i++){
  	scanf("%s",a[i]);
  }
	for(int k = 0;k < n;k++){
      if(a[k][0] == 'B'){
        B++;
      }
    }
  
  for(int i = 0;i < n;i++){
    for(int j = 0;j < 11;j++){
      if(a[i][j+1] == '\0'&& a[i][j] == 'A'){
        A++;
      }
      if(a[i][j] == 'A' && a[i][j+1] == 'B'){
          count++;
      }
    }
  }
	 
  
 if(A <= B){
    count += A;
 }else{ 
	count += B;
 }
 
    printf("%d",count);
 
  return 0;
  
}