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.*;
import java.lang.*;

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();
		}
		int a = 0;
		int b = 0;
		int ab = 0;
		int contain = 0;
		for (int i = 0; i < n; i++) {
			if (s[i].charAt(0) == 'B' && s[i].charAt(s[i].length() - 1) == 'A') {
				ab++;
			}
			if (s[i].charAt(0) == 'B') {
				b++;
			}
			if (s[i].charAt(s[i].length() - 1) == 'A') {
				a++;
			}
			while (s[i].indexOf("AB") != -1) {
				contain++;
				s[i] = s[i].substring(s[i].indexOf("AB") + 2);
			}
		}
		if (a == b && ab == a && ab != 0) {
			System.out.println(contain + ab - 1);
		} else {
			System.out.println(contain + Math.min(a, b));
		}
	}
}