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.*;
class Main {
    public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);
	int n = Integer.parseInt(sc.next());
	long cnt = 0;
	long a = 0;
	long b = 0;
	long ab = 0;
	for(int i = 0; i<n; i++) {
	    String s = sc.next();
	    cnt += (s.length() - s.replace("AB","").length()) / 2;
	    if(s.charAt(0) == 'B' && s.charAt(s.length()-1) == 'A') ab++;
	    else if(s.charAt(0) == 'B') b++;
	    else if(s.charAt(s.length()-1) == 'A') a++;
	    //	    System.out.println(cnt + " " + ab +" " +a+" " + b);
	}

	long ans = Math.min(a,b) + ab +cnt;


	long min = (long)Math.min(a,b);
	if(min >= ab) ans = min+ab+cnt;
	else ans = cnt + min*2 +(ab-min);
	if(a==0&& b==0 && ab>0) ans = ab -1 +cnt;
	if(ab == n) ans = ab -1 +cnt;

	System.out.println(ans);

    }
}