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];

        int ab = 0;
        int xa = 0;
        int bx = 0;
        int bxa = 0;

        for(int i = 0; i < n; i++){
            s[i] = sc.next();

            if(s[i].charAt(s[i].length() - 1) == 'A'){
                if(s[i].charAt(0) == 'B'){
                    bxa++;
                }else{
                    xa++;
                }
            }else if(s[i].charAt(0) == 'B'){
                bx++;
            }
            for(int j = 0; j < s[i].length(); j++){
                int index = s[i].indexOf("AB", j);
                if(index != -1){
                    j = index;
                    ab++;
                }else{
                    j = s[i].length();
                }
            }
        }

        if(bxa > 0){
            ab += bxa - 1;
            if(xa > 0){
                xa--;
                ab++;
            }
            if(bx > 0){
                bx--;
                ab++;
            }
        }
        ab += Math.min(xa, bx);
        System.out.println(ab);

    }

}
