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();
		char[] s = new char[n];
		String hoge;
		String A = "A";
		String B = "B";
		int a=0, b=0, c=0, sum=0;
		for(int i=0;i<n;i++) {
			hoge =sc.next();
			char[] chara = hoge.toCharArray();
			if(chara[0]==B.toCharArray()[0] && chara[hoge.length()-1]==A.toCharArray()[0]) {// head is B and tale is A
				c++;
			}
			else if(chara[0]==B.toCharArray()[0]) {//head is B
				b++;
			}
			else if(chara[hoge.length()-1]==A.toCharArray()[0]) {//tale is A
				a++;
			}
			for(int j=0;j<hoge.length()-1;j++) {//how many AB is in
				if(chara[j]==A.toCharArray()[0] && chara[j+1]==B.toCharArray()[0]) {
					sum++;
				}
			}
		}
		if(a==0 && b==0) {
			if(c>0) {
				sum+=c-1;
			}
		}
		else {
			sum+=min(a, b)+c;
		}
		System.out.print(sum);
		
	}
	
	public static int min(int a, int b) {
		if(a<=b) {
			return a;
		}
		else {
			return b;
		}
	}

	
}