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.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        String[] s = new String[n];
        int ab = 0;
        int startBEndA = 0;
        int startB = 0;
        int endA = 0;
        for (int i = 0; i < n; i++) {
            s[i] = sc.next();
            for (int j = 0; j < s[i].length() - 1; j++) {
                if (s[i].charAt(j) == 'A' && s[i].charAt(j + 1) == 'B') {
                    ab++;
                }
            }
            if (s[i].startsWith("B") && s[i].endsWith("A")) {
                startBEndA++;
                continue;
            }
            if (s[i].startsWith("B")) {
                startB++;
            }
            if (s[i].endsWith("A")) {
                endA++;
            }
        }
        int ans = ab;
        if (startBEndA == 0) {
            ans += Math.min(startB, endA);
        } else {
            if (startB == 0 && endA == 0) {
                ans += startBEndA - 1;
            } else {
                ans += startBEndA + Math.min(startB, endA);
            }
        }
        System.out.println(ans);
    }

}
