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;

class Main {
    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int abCount = 0;
        int topBandendA = 0;//先頭がBで最後がA
        int topB = 0;//先頭がB
        int endA = 0;//最後がA
        Boolean addBfrag = false;
        String[] s = new String[N];
        //入力処理
        //入力ごとに文字列中のABの数を数える
        for (int i = 0; i < N; i++) {
            s[i] = sc.next();
            abCount += abCount(s[i]);
            if (s[i].startsWith("B") && endWith(s[i], 'A')) {
                topBandendA++;
            } else if (s[i].startsWith("B")) {
                topB++;
            } else if (endWith(s[i], 'A')) {
                endA++;
            }
        }

        if (endA > 0) {
            endA--;
            addBfrag = true;
        } else if (topBandendA > 0) {
            topBandendA--;
            addBfrag = true;
        }
        while (topBandendA > 0) {
            topBandendA--;
            abCount++;
        }
        if (topB > 0 && addBfrag) {
            topB--;
            abCount++;
        }
        while (endA > 0 && topB > 0) {
            endA--;
            topB--;
            abCount++;
        }

        System.out.println(abCount);
    }

    private static int abCount(String s) {
        int abNum = 0;
        int from = -1;
        Boolean frag = true;
        while (frag) {
            from = s.indexOf("AB", from);
            if (from != -1) {
                from++;
                abNum++;
            } else {
                frag = false;
            }
        }
        return abNum;
    }

    private static Boolean endWith(String s, char endChar) {
        Boolean frag;
        char check = s.charAt(s.length() - 1);
        if (endChar == check) {
            frag = true;
        } else {
            frag = false;
        }
        return frag;
    }
}