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 {
    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 startWithB_and_endWithA = 0;
        int startWithB = 0;
        int endWithA = 0;
        int internalAB = 0;
        for (int i = 0; i < N; i++) {
            boolean start_b = s[i].charAt(0) == 'B';
            boolean end_a = s[i].charAt(s[i].length()-1) == 'A';
            if (start_b && end_a) {
                startWithB_and_endWithA++;
            } else if (start_b) {
                startWithB++;
            } else if (end_a) {
                endWithA++;
            }
            for (int j = 0; j < s[i].length() - 1; j++) {
                if(s[i].charAt(j) == 'A' && s[i].charAt(j+1) == 'B') {
                    internalAB++;
                }
            }
        }
        int ans = 0;
        if(startWithB_and_endWithA == 0) {
            ans += internalAB + Math.min(startWithB, endWithA);
        } else {
            ans += internalAB + startWithB_and_endWithA - 1;
            if (startWithB > 0) {
                ans++;
                startWithB--;
            }
            if (endWithA > 0) {
                ans++;
                endWithA--;
            }
            ans += Math.min(startWithB, endWithA);
        }
        System.out.println(ans);
    }
}