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 <string.h>

int main(){
    int N;
    char s[11];
    char *temp;
    int A, B, AB, sum;
    int i, len;
    scanf("%d",&N);
    getchar();// \nを捨てる
    A = B = AB = 0;
    for(i=0; i<N; i++){
        scanf("%s",s);
       // printf("  %s\n", s);
        temp = s;
        temp = strstr(s, "AB");
        while(temp != NULL){
            AB++;
            temp++;
            temp = strstr(temp, "AB");
        }
        if(s[0] == 'B')B++;
        len = strlen(s);
        if(s[len-1] == 'A')A++;
    }
    if(A < B){
        sum = A + AB;
    }else{
        sum = B + AB;
    }

    printf("%d", sum);
}