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);
        long a = 0;
        long b = 0;
        long ab = 0;
        String tmp;
        long ba = 0;
        long n = sc.nextInt();
        for (int i = 0; i < n; i++) {
            tmp = sc.next();
            if (tmp.charAt(0) == 'B' && tmp.charAt(tmp.length() - 1) == 'A') {
                ba++;
            } else if (tmp.charAt(0) == 'B') {
                b++;
            } else if (tmp.charAt(tmp.length() - 1) == 'A') {
                a++;
            }
            ab += (tmp.length() - tmp.replaceAll("AB", "").length()) / 2;
        }
        if (ba == 0) {
            System.out.println(Math.min(a, b) + ab);
        } else if(a==0&&b==0){
            System.out.println(ba-1+ab);
        }else{
            System.out.println(ba+Math.min(a,b)+ab);
        }

    }
}