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
#include <iostream>
#include <string>
using namespace std;

int main() {
    int N;
    cin >> N;
    long long T = 0, c1 = 0, c2 = 0, c3 = 0;
    for (int i = 0; i < N; ++i) {
        string S;
        cin >> S;
        for (int j = 0; j + 1 < S.size(); ++j) {
            if (S[j] == 'A' && S[j + 1] == 'B') ++T;
        }
        if (S[0] == 'B' && S.back() == 'A') ++c1;
        else if (S.back() == 'A') ++c2;
        else if (S[0] == 'B') ++c3;
    }
    if (c2 == 0 && c3 == 0) cout << T + max(c1 - 1, 0LL) << endl;
    else cout << T + c1 + min(c2, c3) << endl;
}