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 {
	Scanner sc = new Scanner(System.in);

	void doIt() {
		int n = sc.nextInt();
		String s[] = new String[n];
		int acnt = 0, bcnt = 0, same = 0;
		for(int i = 0; i < n; i++) {
			s[i] = sc.next();
			char cs = s[i].charAt(0), ce = s[i].charAt(s[i].length() - 1);
			if(cs == 'B' && ce == 'A') {
				acnt++;
				bcnt++;
				same++;
			}
			else if(cs == 'B')acnt++;
			else if(ce == 'A')bcnt++;
		}
		int mcnt = (acnt < bcnt) ? acnt : bcnt;
		if(acnt == bcnt && mcnt == same && same != 0) mcnt--;
		int cnt = 0;
		for(int i = 0; i < n; i++) {
			for(int j = 0; j < s[i].length() - 1; j++) {
				if(s[i].substring(j, j + 2).equals("AB")) {
					cnt++;
				}
			}
		}
		System.out.println(mcnt + cnt);
	}


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