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 cntFirstB = 0;
		int cntLastA = 0;
		int cntAB = 0;
		int cntFirstBLastA = 0;
		int answer = 0;

		for (int i = 0; i < N; i++) {
			String s = sc.next();
			if (s.charAt(0) == 'B')
				cntFirstB++;
			if (s.charAt(s.length() - 1) == 'A')
				cntLastA++;
			if (s.charAt(0) == 'B' && s.charAt(s.length() - 1) == 'A')
				cntFirstBLastA++;
			int startId = s.indexOf("AB");
			while (startId != -1) {
				cntAB++;
				startId = s.indexOf("AB", startId + 2);
			}
		}
		if (cntFirstBLastA > 0 && cntFirstBLastA == cntFirstB && cntFirstBLastA == cntLastA)
			answer = cntAB + cntFirstBLastA - 1;
		else
			answer = cntAB + Math.min(cntFirstB, cntLastA);
		sc.close();
		System.out.println(answer);
	}
}
