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 {
    public static void main(String[] args) throws Exception {
        // Your code here!
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        boolean xbANDa = false;
        boolean bANDxa = false;
        int acount = 0;
        int bcount = 0;
        int abcount = 0;
        
        for (int i = 0; i < n; i++) {
            String str = sc.next();
            if (str.charAt(0) != 'B' && str.charAt(str.length() - 1) == 'A') {
                acount++;
                xbANDa = true;
            }
            if (str.charAt(0) == 'B' && str.charAt(str.length() - 1) != 'A') {
                bcount++;
                bANDxa = true;
            }
            if (str.charAt(0) == 'B' && str.charAt(str.length() - 1) == 'A') {
                acount++;
                bcount++;
            }
            for (int j = 0; j < str.length() - 1; j++) {
                if (str.charAt(j) == 'A' && str.charAt(j + 1) == 'B') {
                    abcount++;
                }
            }
        }
        
        int count = 0;
        if (xbANDa || bANDxa) {
            count = Math.min(acount, bcount);
        } else {
            count = Math.max(0, acount - 1);
        }
        
        System.out.println(count + abcount);
    }
}
