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();
        int ab = 0;
        int a = 0;
        int b = 0;
        int ba = 0;
        for (int i = 0; i < n; i++) {
            char[] s = sc.next().toCharArray();
            if(s[0] == 'B') b++;
            if(s[s.length-1] == 'A') a++;
            if(s[0] == 'B' && s[s.length-1] == 'A') ba++;
            for (int j = 0; j < s.length - 1; j++) {
                if(s[j] == 'A' && s[j+1] == 'B') ab++;
            }
        }
        int c = (a == ba && b == ba && 0 < ba)? ba - 1 : Math.min(a, b);
        System.out.println(ab + c);
        sc.close();
    }

}
