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 {
	Scanner sc = new Scanner(System.in);
	
	public static void main(String[] args) {
		Main m = new Main();
		m.run();
	}
	
	void run() {
		int n = sc.nextInt();
		String[] s = new String[n];
		
		int count = 0;
		int startFromB =0;
		int endWithA =0;
		int B_A = 0;
		
		for(int i = 0 ; i < n ; i++) {
			s[i] = sc.next();
			
			count += countAB(s[i]);
			
			if(s[i].charAt(0) == 'B') {
				startFromB ++;
			}
			if(s[i].charAt(s[i].length()-1) == 'A') {
				endWithA ++;
			}

			if(s[i].charAt(0) == 'B') {
				if(s[i].charAt(s[i].length()-1) == 'A') {
					B_A++;
				}
			}				
		}
		
		
		int byConcat = Math.min(Math.min(startFromB, endWithA), n-1) ;

		if(Math.max(startFromB, endWithA) == B_A) {
			byConcat = Math.max(0, B_A - 1);
		}
		
		System.out.println(count +byConcat);
		
	}
	
	int countAB(String str) {
		int res = 0;
		int flg = 0;
		for(char ch : str.toCharArray()) {
			if(flg == 0) {
				if(ch == 'A') {
					flg = 1;
				}else {
					flg = 0;
				}
			}else {
				if(ch == 'B') {
					res++;
				}
				if(ch != 'A') {
					flg = 0;
				}
				
			}
		}
		return res;
	}
}
