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 scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        String [] str = new String[n];
        int count = 0;
        int A = 0;
        int B = 0;
        int BA = 0;
        for (int i = 0; i < n; ++i) {
            str[i] = scanner.next();
        }
        for (int i = 0; i < n; ++i) {
            String current = str[i];
            for (int j = 0; j < current.length() - 2; ++j) {
                if (current.charAt(j) == 'A' && current.charAt(j + 1) == 'B') {
                    ++count;
                }
            }
            if (current.charAt(0) == 'B' && current.charAt(current.length() - 1) == 'A') {
                ++BA;
            } else if (current.charAt(0) == 'B') {
                ++B;
            } else if (current.charAt(current.length() - 1) == 'A') {
                ++A;
            }
        }
        if (BA >= 2) {
            count += BA - 1;
            if (A > 0) {
                ++count;
            }
            if (B > 0) {
                ++count;
            }
        } else {
            if (BA > 0) {
                if (A > 0) {
                    ++count;
                }
                if (B > 0) {
                    ++count;
                }
            } else {
                if (A > 0 && B > 0) {
                    ++count;
                }
            }
        }
        if (A - 1 > 0 && B - 1 > 0) {
            count += Math.min(A, B) - 1;
        }

        System.out.println(count);

    }
}
