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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.Scanner;
public class Main {
	public static void main(String[] args){
		Scanner stdIn=new Scanner(System.in);
		int N=stdIn.nextInt();
		String s[]=new String[N];
		int z=0,y=0,A=0,B=0,ans=0;
		while(z<N){
			s[z]=stdIn.next();
			if(s[z].charAt(s[z].length()-1)=='A')
				A++;
			if(s[z].charAt(0)=='B')
				B++;
			while(y<s[z].length()-1){
				if(s[z].charAt(y)=='A')
					if(s[z].charAt(y+1)=='B'){
						ans++;y++;
					}
				y++;
			}
			y=0;
			z++;
		}
		if(A<=B&&A<N)
			ans+=A;
		else
			if(A>B&&B<N)
				ans+=B;
			else
				ans+=N-1;
		System.out.println(ans);
	}
}