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();
		int lB = 0;
		int rA = 0;
		int lrBA = 0;

		int ans = 0;
		for (int i = 0; i < n; i++) {
			String s = sc.next();
			boolean isLeftB = false;
			boolean isRightA = false;
			if (s.charAt(0) == 'B')
				isLeftB = true;
			if (s.charAt(s.length()-1) == 'A')
				isRightA = true;

			if (isLeftB && isRightA)
				lrBA++;
			else if (isLeftB)
				lB++;
			else if (isRightA)
				rA++;

			for (int j = 0; j < s.length(); j++) {
				if (s.indexOf("AB", j) >= 0) {
					ans++;
					j = s.indexOf("AB", j);
				} else {
					break;
				}
			}
		}

		if (lrBA == 0) {
			ans += Math.min(lB, rA);
		} else {
			if (lB == 0 && rA == 0)
				ans += lrBA - 1;
			else
				ans += lrBA += Math.min(rA, lB);
		}
		System.out.println(ans);
	}
}