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 {

    void run() {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int ans = 0;
        LinkedList<Integer> as = new LinkedList<>(), bs = new LinkedList<>();
        HashSet<Integer> ain = new HashSet<>();

        for (int i = 0; i < n; i++) {
            String s = sc.next();
            for (int j = s.length() - 2; j > 0; j--) {
                if (s.charAt(j - 1) == 'A' && s.charAt(j) == 'B') ans++;
            }
            if (s.charAt(0) == 'B') {
                if (s.charAt(s.length() - 1) == 'A') bs.addFirst(i);
                else bs.addLast(i);
            }
            if (s.charAt(s.length() - 1) == 'A') {
                if (s.charAt(0) == 'B') {
                    as.addLast(i);
                } else {
                    as.addFirst(i);
                }
                ain.add(i);
            }
        }
//        debug(ans, as, bs);

        boolean[] used = new boolean[n];
        if (!as.isEmpty()) {
            int i = as.removeFirst();
            while (!bs.isEmpty()) {
                if (ain.contains(i)) {
                    // nothing
                } else {
                    used[i] = true;
                    while (!as.isEmpty() && used[i]) i = as.removeFirst();
                    if (used[i]) break;
                }
                used[i] = true;
                while (!bs.isEmpty()) {
                    int j = bs.remove();
                    if (used[j]) continue;
//                debug(i, j);
                    i = j;
                    ans++;
                    break;
                }
            }
        }
        System.out.println(ans);
    }

    void debug(Object...os) {
        System.err.println(Arrays.deepToString(os));
    }

    public static void main(String[] args) {
        new Main().run();
    }
}
