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 = Integer.parseInt(sc.next());
		
		String []s = new String [n];
		int anum = 0;;
		int []ab = new int [n];
		int bnum = 0;
		int abnum = 0;
		
		for(int i = 0 ; i < n ;i++) {
			s[i] = sc.next();
		}
		
		for(int i = 0 ; i < n ; i++) {
			if(s[i].charAt(0) == 'B' && s[i].charAt(s[i].length()-1) == 'A') abnum++;
			else if(s[i].charAt(0) =='B') bnum++;
			else if(s[i].charAt(s[i].length()-1) == 'A')	anum++;
			for(int j = 0 ; j < s[i].length()-1 ; j++) {
				if(s[i].charAt(j) == 'A' && s[i].charAt(j+1) == 'B') ab[i]++;
			}
		}
		
		
		int ans = 0;
		
		for(int i = 0; i < n ;i++) {
			ans += ab[i];
		}
		if(abnum == 0) {
			ans += Math.min(anum, bnum);
		}
		
		else {
			ans += abnum;
			if(anum == 0 && bnum == 0) {
				ans--;
			}
			else if(anum != 0 && bnum != 0) {
				ans += Math.min(anum, bnum);
			}
		}
		System.out.println(ans);
		
	}

}
