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 sc = new Scanner(System.in);
        int n = sc.nextInt();
        String[] s = new String[n];
        for (int i = 0 ; i < n ; i++) {
            s[i] = sc.next();
        }
        int count = 0;
        int a = 0;
        int b = 0;
        int ba = 0;
        for (int i = 0 ; i < n ; i++) {
            for (int j = 0 ; j < s[i].length() - 1 ; j++) {
                if (s[i].substring(j, j + 2).equals("AB")) count++;
            }
            char first = s[i].charAt(0);
            char last = s[i].charAt(s[i].length() - 1);
            if (first != 'B' && last == 'A') a++;
            if (first == 'B' && last != 'A') b++;
            if (first == 'B' && last == 'A') ba++;
        }

        if (ba == 0) {
            count += Math.min(a, b);
        } else {
            if (a + b > 0) {
                count += ba + Math.min(a, b);
            } else {
                count += ba - 1;
            }
        }

        System.out.println(count);
    }

}