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.math.BigInteger;
import java.util.*;

public class Main {
	
	private void doit(){
		Scanner sc = new Scanner(System.in);
		while(sc.hasNext()){
			int n = sc.nextInt();
			String [] data = new String[n];
			for(int i = 0; i < n; i++){
				data[i] = sc.next();
			}
			
			int count = 0;
			int pre = 0, suf = 0, med = 0;
			for(int i = 0; i < n; i++){
				for(int j = 1; j < data[i].length(); j++){
					if(data[i].charAt(j-1) == 'A' && data[i].charAt(j) == 'B'){
						count++;
					}
				}
				
				if(data[i].charAt(0) == 'B' && data[i].charAt(data[i].length()-1) == 'A') {
					med++;
				}
				else if(data[i].charAt(0) == 'B') {
					pre++;
				}
				else if(data[i].charAt(data[i].length()-1) == 'A'){
					suf++;
				}
			}
			int res = 0;
			res += Math.min(pre, suf);
			int rest = Math.max(pre, suf) - Math.min(suf, pre);
			if(rest < med){
				res += med;
				if(Math.max(pre, suf) == 0){
					res --;
				}
			}
			else {
				res += Math.min(rest, med);
			}
//			debug(count, pre, suf, med, res);
			System.out.println(count + res);
		}
	}

	private void debug(Object... o) {
		System.out.println("debug = " + Arrays.deepToString(o));
	}

	public static void main(String[] args) {
		new Main().doit();
	}

}
