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 acount=0;
        int bcount=0;
        int count=0;
        int both=0;
        for(int i=0;i<n;i++){
            if(s[i].charAt(0)=='B') bcount++;
            if(s[i].charAt(s[i].length()-1)=='A') acount++;
            if(s[i].charAt(0)=='B' &&s[i].charAt(s[i].length()-1)=='A') both++;
            for(int k=0;k<s[i].length()-1;k++){
                if(s[i].charAt(k)=='A' && s[i].charAt(k+1)=='B') count++;
            }
        }
        int min=Math.min(acount,bcount);
        if(both==0 ||acount+bcount-both*2>0) System.out.println(count+min);
        else  System.out.println(both+count-1);
        
        
    }
}