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 = Integer.parseInt(sc.next());
        String[] s = new String[n];
        Arrays.setAll(s, i -> sc.next());
        sc.close();

        // 主処理
        int result = 0;
        int countEndA = 0;
        int countStartB = 0;
        int countEndAStartB = 0;
        for (int i = 0; i < n; i++) {
            String replaced = s[i].replace("AB", "");
            result += (s[i].length() - replaced.length()) / 2;
            boolean isEndA = replaced.endsWith("A");
            boolean isStartB = replaced.startsWith("B");
            if (isEndA && isStartB) {
                countEndAStartB++;
                countEndA++;
                countStartB++;
            } else {
                if (isEndA) {
                    countEndA++;
                }
                if (isStartB) {
                    countStartB++;
                }
            }
        }
        if (0 < countEndA && 0 < countStartB && countEndA == countStartB) {
            if (countEndA == countEndAStartB) {
                result += countEndAStartB - 1;
            } else {
                result += countEndA;
            }
        } else {
            result += Math.min(countEndA, countStartB);
        }

        // 出力
        System.out.println(result);
    }
}
