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();
		long ans=0;
		int a=0;
		int b=0;
		int count=0;
		for(int i = 0; i<n; i++){
			boolean bb=false;
			boolean aa=false;
			String s = sc.next();
			for(int j=0; j<s.length(); j++){
				if(j==0){
					if(s.charAt(j)=='B'){
						b++;
						bb=true;
					}
				}
				if(j==s.length()-1){
					if(s.charAt(j)=='A'){
						a++;
						aa=true;
					}
					if(aa && bb){
						count++;
					}
					break;
				}
				if(s.charAt(j)=='A' && s.charAt(j+1)=='B'){
					ans++;
				}
			}
		}
		if(count==a && count==b && a>0){
			System.out.println(a-1+ans);
		}else{
		 	System.out.println(ans+Math.min(a,b));
		}
	}
}
