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) throws Exception {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int ans = 0;
		String[] s = new String[n];
		int cnt1 = 0;
		int cnt2 = 0;
		int cnt3 = 0;
		for(int i = 0; i < n; i++) {
			s[i] = sc.next();
			if(s[i].substring(0, 1).equals("B") &&s[i].substring(s[i].length()-1, s[i].length()).equals("A")) {
				cnt1 ++;
			}else if(s[i].substring(0, 1).equals("B")) {
				cnt2 ++;
			}else if(s[i].substring(s[i].length()-1, s[i].length()).equals("A")) {
				cnt3 ++;
			}
		}
		if(cnt1 == 0) {
			ans += cnt1 + Math.min(cnt2, cnt3);
		}else if(cnt2 + cnt3!= 0) {
			ans += cnt1 + Math.min(cnt2, cnt3);
		}else {
			ans += cnt1-1;
		}
		String[] t = new String[n];
		for(int i = 0; i < n; i++) {
			t[i] = s[i];
			t[i] = t[i].replace("AB", "X");
			ans += s[i].length() - t[i].length();
		}
		System.out.println(ans);
		sc.close();
	}
}
