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.*;
import static java.lang.Math.*;

public class Main {
	public static void main(String[] args) {
		int i;
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		String[] s = new String[n];
		int a=0;
		int b=0;
		int ba=0;
		int ab=0;
		int j;
		for(i=0; i<n; i++) {
			s[i] = sc.next();
			for(j=0; j<s[i].length()-1; j++){
				if(s[i].charAt(j) == 'A' && s[i].charAt(j+1) == 'B') {
					ab++;
					j++;
				}
			}
			if(s[i].charAt(0)=='B') {
				b++;
				if(s[i].charAt(s[i].length()-1)=='A') {
					ba++;
				}
			}
			if(s[i].charAt(s[i].length()-1)=='A') {
				a++;
			}
		}
		sc.close();
		sc = null;
		if(a>0 && a==b && a==ba) {
			System.out.println(a+ab-1);
		} else {
			System.out.println(min(a, b)+ab);
		}
	}
}
