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 ab_count = 0;
		int head_b = 0;
		int tail_a = 0;
		int contain_ba = 0;
		// 整数の入力
		int n= sc.nextInt();
		for(int i=0;i<n;i++) {
			String s = sc.next();
			boolean aflag = false;
			for(char c: s.toCharArray()) {
				if (aflag && c == 'B') {
					ab_count++;
				}
				
				if (c == 'A') {
					aflag = true;
				} else {
					aflag = false;
				}
			}
			if(s.toCharArray()[0] == 'B') {
				head_b++;
			}
			
			if(s.toCharArray()[s.length()-1] == 'A') {
				tail_a++;
				if(s.toCharArray()[0] == 'B') {
					
					contain_ba++;
				}
			}
			

		}
		
		int ab = Math.min(tail_a, head_b);
		if (tail_a == contain_ba && head_b == contain_ba) {
			ab--;
		}
		if (ab >= 0) {
		System.out.println(ab+ab_count);
		} else {
			System.out.println(ab_count);
		}
		
//		System.out.println(ab_count);
//		System.out.println(head_b);
//		System.out.println(tail_a);
//		System.out.println(contain_ba);


	}
}