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 JavaScript (node.js v5.12) (judge verdict: Runtime Error)

function main() {
    var strNum = input[0] +1;
    var result = 0;
    for (var i = 1; i < strNum; i++){
        result += Number(input[i].split("AB").length) - 1;
    };
  
  	for(var j = 1;j < strNum; j++){
      for(var n = 1;n < strNum; n++){
        if(n == j){
          continue;
        }        
      	if((input[j].toString().slice(-1) + input[n].toString().slice(0,1)) === 'AB'){
        	result++;
        };
      }
    }
    console.log(result);
};

main(require('fs').readFileSync('/dev/stdin', 'utf8'));