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.

Examples

Input

3
ABCA
XBAZ
BAD


Output

2


Input

9
BEWPVCRWH
ZZNQYIJX
BAVREA
PA
HJMYITEOX
BCJHMRMNK
BP
QVFABZ
PRGKSPUNA


Output

4


Input

7
RABYBBE
JOZ
BMHQUVA
BPA
ISU
MCMABAOBHZ
SZMEHMA


Output

4
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		String [] S = new String [n];
		
		int c_a = 0;
		int c_b = 0;
		int c_ab = 0;
		int count = 0;
		
		for (int i = 0; i<n; i++){
			S [i] = sc.next();
			
			if (S[i].charAt(0)=='B' && S[i].charAt(S[i].length()-1)=='A'){
				c_ab++;
			}

			if (S[i].charAt(0)=='B')
				c_b++;
			
			if (S[i].charAt(S[i].length()-1)=='A')
				c_a++;
			
			int j = 0;
			while (j<S[i].length()-1){
				if (S[i].charAt(j)!='A'){
					j++;
				}
				else {
					if (S[i].charAt(j+1) =='B'){
						count++;
						j++;
					}
					else
						j++;
				}
			}
		}
		sc.close();
		
		if (n==1)
			System.out.println(count);
		
		else if (c_ab!=0 && c_a==c_ab && c_b==c_ab)
			System.out.println(count+c_ab-1);
	
		else
			System.out.println(count+Math.min(c_a, c_b));
	}
}