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];

			for(int i = 0 ; i < N ; i++){
				S[i] = sc.next();
			}


		sc.close();

		int result = 0;
		int count = 0;
		int Acount = 0;
		int Bcount = 0;
		int ABcount = 0;

		for(int i = 0 ; i < N ; i++){

			if(S[i].substring(0, 1).equals("B") && !S[i].substring(S[i].length()-1, S[i].length()).equals("A")){
				Bcount++;
			}
			if(!S[i].substring(0, 1).equals("B") &&S[i].substring(S[i].length()-1, S[i].length()).equals("A")){
				Acount++;
			}
			if(S[i].substring(0, 1).equals("B") && S[i].substring(S[i].length()-1, S[i].length()).equals("A")){
				ABcount++;
			}



	        for (int j = 0; j < S[i].length(); j++) {
	            result = S[i].indexOf("AB", j);
	            if (result != -1) {
	                count++;
	                j = result;
	            }
	        }
		}

		if(ABcount == 0){
			System.out.println(Math.min(Acount, Bcount)+count);
		}
		else if(Acount + Bcount > 0){
			System.out.println(ABcount + Math.min(Acount, Bcount)+count);
		}
		else if(Acount + Bcount == 0){
			System.out.println(count+ABcount-1);
		}

	}
}