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.*;

public class Main {
	public static void main (String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int startB = 0;
		int endA = 0;
		int matchCount = 0;
		int abCount = 0;
		for (int i = 0; i < n; i++) {
			char[] arr = sc.next().toCharArray();
			if (arr[0] == 'B' && arr[arr.length - 1] == 'A') {
				startB++;
				endA++;
				matchCount++;
			} else if (arr[0] == 'B') {
				startB++;
				matchCount++;
			} else if (arr[arr.length - 1] == 'A') {
				endA++;
				matchCount++;
			}
			for (int j = 0; j < arr.length - 1; j++) {
				if (arr[j] == 'A' && arr[j + 1] == 'B') {
					abCount++;
				}
			}
		}
		abCount += Math.min(Math.min(startB, endA), Math.max(matchCount - 1, 0));
		System.out.println(abCount);
	}
}
