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();
		String[] s = new String[N];
		for(int i = 0;i < N;i++) {
			s[i] = sc.next();
		}
		sc.close();

		int cnt = 0;
		int lastA = 0;
		int firstB = 0;
		int lastA_And_firstB = 0;
		for(int i = 0;i < N;i++) {
			for(int j = 0;j < s[i].length()-1;j++) {
				if(s[i].substring(j,j+2).equals("AB")) {
					cnt++;
				}
			}
		}
		for(int i = 0;i < s.length;i++) {
			if(s[i].startsWith("B") && s[i].endsWith("A")) {
				lastA_And_firstB++;
			}else if(s[i].startsWith("B") && !s[i].endsWith("A")) {
				firstB++;
			}else if(!s[i].startsWith("B") && s[i].endsWith("A")) {
				lastA++;
			}
		}
		if(lastA_And_firstB == 0) {
			cnt += Math.min(lastA, firstB);
		}else{
			if(lastA + firstB > 0) {
				cnt += (lastA_And_firstB + Math.min(lastA, firstB));
			}else {
				cnt += (lastA_And_firstB - 1);
			}
		}
		System.out.println(cnt);
	}
}