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[]) {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            String[] s = new String[N];
            for (int i = 0; i < N; i++) {
                s[i] = in.next();
            }

            int count = 0;
            for (int i = 0; i < N; i++) {
                count += countAC(s[i]);
            }

            int countBA = 0;
            int countB = 0;
            int countA = 0;
            for (int i = 0; i < N; i++) {
                if (s[i].charAt(0) == 'B' && s[i].charAt(s[i].length() - 1) == 'A') {
                    countBA++;
                } else if (s[i].charAt(0) == 'B') {
                    countB++;
                } else if (s[i].charAt(s[i].length() - 1) == 'A') {
                    countA++;
                }
            }

            if (countBA - 1 >= 0) {
                count += countBA - 1;
                countBA = 1;
                if (countA > 0) {
                    count++;
                    countA--;
                }
                if (countB > 0) {
                    count++;
                    countB--;
                }
            }
            count += Math.min(countA, countB);

            System.out.println(count);
        }
    }

    private static int countAC(String s) {
        int count = 0;
        for (int i = 1; i < s.length(); i++) {
            if (s.charAt(i - 1) == 'A' && s.charAt(i) == 'B') {
                count++;
            }
        }
        return count;
    }
}
