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 scn = new Scanner(System.in);
		int N = scn.nextInt();
		int ans = 0;
		int A = 0, B = 0;
		boolean minus = true;
		String[] str = new String[N];
		scn.nextLine();
		for(int i = 0;i < N;i++) {
			String buf = scn.nextLine();
			char[] ch = buf.toCharArray();
			boolean isA = false;
			for(int j = 0;j < ch.length;j++) {
				if(j == 0) {
					if(ch[j]=='B')B++;
				}
				if(j == ch.length-1) {
					if(ch[j] == 'A')A++;
					if(B!=A)minus = false;
				}
				if(isA) {
					if(ch[j]=='B') ans++;
				}

				if(ch[j]=='A') {
					isA = true;
				}else {
					isA = false;
				}
			}
		}
		ans+= Math.min(A, B);
		if(minus&&A!=0)ans--;
		System.out.println(ans);

	}

}
