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.io.BufferedReader;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) throws Exception {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(reader.readLine());
        int bsizea = 0;
        int sizea = 0;
        int bsize = 0;
        int count = 0;
        for (int i = 0; i < n; i++) {
            String s = reader.readLine();
            for (int idx = s.indexOf("AB"); idx > -1; idx = s.indexOf("AB", idx + 2)) {
                count++;
            }
            if (s.startsWith("B") && s.endsWith("A")) {
                bsizea++;
            } else if (s.endsWith("A")) {
                sizea++;
            } else if (s.startsWith("B")) {
                bsize++;
            }
        }
        System.out.println(count + Integer.min(sizea, bsize)
                + ((sizea + bsize == 0) ? Integer.max(bsizea - 1, 0) : bsizea));
    }
}
