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) throws Exception {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] abs = new int[3];
        int ans = 0;
        for(int i = 0; i < n; i++){
            String tmp = sc.next();
            int index = 0;
            while(index < tmp.length()){
                int now = tmp.indexOf("AB", index);
                if(now != -1){
                    index = now+1;
                    ans++;
                }else{
                    break;
                }
            }
            boolean topB = tmp.charAt(0) == 'B' ? true : false;
            boolean lastA = tmp.charAt(tmp.length()-1) == 'A' ? true : false;
            if(topB && lastA){
                abs[0]++;
            }else if(topB){
                abs[1]++;
            }else if(lastA){
                abs[2]++;
            }
        }
        if(abs[1]+abs[2] == 0){
            System.out.println(ans + Math.max(0,abs[0]-1));
        }else if(abs[0]+abs[1] <= abs[2]){
            System.out.println(ans + abs[0]+abs[1]);
        }else if(abs[0]+abs[2] <= abs[1]){
            System.out.println(ans + abs[0]+abs[2]);
        }else{
            abs[0] -= Math.abs(abs[1]-abs[2]);
            System.out.println(ans + abs[0]+Math.max(abs[1],abs[2]));
        }
    }
}