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.io.*;
import java.util.*;


public class Main {
    static long mod = 1000000000+7;
    static int n,a,b,k;
    public static void main(String[] args) throws Exception{
        Scanner sc = new Scanner(System.in);
        //BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        //String[] buf = reader.readLine().split(" ");
        n = sc.nextInt();
        long ans = 0,head =0, tail = 0, dou = 0;
        for(int i=0;i<n;i++){
            char[] s = sc.next().toCharArray();
            int len = s.length;
            for(int j=0;j<len-1;j++){
                if(s[j]=='A'&&s[j+1]=='B') ans++;
            }
            if(s[0]=='B'&&s[len-1]=='A') dou++;
            else if(s[0]=='B') head++;
            else if(s[len-1]=='A') tail++;
        }
        ans += help(head,tail,dou);
        System.out.println(ans);
    }
    static long help(long head, long tail, long dou){
        if(tail==0&&dou==0) return 0;
        long ans = 0;
        if(tail==0){
            // then dou!=0;
            dou--;
            tail++;
        }
        //if(dou==0) return Math.min(tail,head);
        ans += dou;
        ans += Math.min(tail,head);
        return ans;
    }
}

