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 ans = 0;
		int a = 0;
		int b = 0;
		int ab = 0;
		for (int i = 0; i < n; i++) {
			String s = sc.next();
			for (int j = 1; j < s.length(); j++) {
				// 文字列の中にあるABをカウント
				if (s.charAt(j - 1) == 'A' && s.charAt(j) == 'B') {
					ans++;
				}
			}
			// 最後がA最初がBの場合 = ab
			// 最後がAの場合 = a
			// 最初がBの場合 = b
			if (s.charAt(s.length() - 1) == 'A') {
				if (s.charAt(0) == 'B') {
					ab++;
				} else {
					a++;
				}
			} else if (s.charAt(0) == 'B') {
				b++;
			}
		}
		// 最後がaのものがない場合、abが有っても組が作れない
		if (a == 0 && ab > 0) {
			ab--;
			a++;
		}

		if (b == 0 && ab > 0) {
			ab--;
			b++;
		}

		int result = ans + ab + Math.min(a, b);
		System.out.println(result);
	}
}