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 <bits/stdc++.h>
using namespace std;

int main(){
    int n; cin >> n;
    int a = 0, b = 0, c = 0, ab = 0;
    for (auto i = 0; i < n; i++) {
        string s; cin >> s;
        if(s.front() == 'B' and s.back() == 'A') c++;
        if(s.front() == 'B' and s.back() != 'A') b++;
        if(s.front() != 'B' and s.back() == 'A') a++;
        for (auto j = 1; j < (int)s.size(); j++) if(s[j - 1] == 'A' and s[j] == 'B') ab++;
    }

    cout << ab + ((a + b > 0) ? min(a, b) + c : ((c == 0) ? 0 : c - 1)) << endl;
    return 0;
}