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.Scanner;

public class Main {

    public static void main(String[] args) {
        solve();
    }

    private static void solve() {
        Scanner input = new Scanner(System.in);

        int n = input.nextInt();

        int cnt = 0;
        int endCnt = 0;
        int startCnt = 0;
        int doubleCnt = 0;

        for (int i = 0; i < n; i++) {
        	String s = input.next();
        	if (s.startsWith("B")) {
        		startCnt++;
        	}
        	if (s.endsWith("A")) {
        		endCnt++;
        	}
        	if (s.startsWith("B") && s.endsWith("A")) {
        		doubleCnt++;
        	}
        	int index = s.indexOf("AB");
        	while (index != -1) {
        		cnt++;
        		index = s.indexOf("AB", index + 1);
        	}
        }

        int combiCnt = Math.min(startCnt, endCnt);

        if (startCnt != 0 && startCnt == endCnt && doubleCnt == endCnt) {
        	combiCnt = combiCnt - 1;
        }

        int ans = cnt + combiCnt;

        System.out.println(ans);
    }
}
