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>

int main(){
    using namespace std;
    unsigned long N;
    cin >> N;
    unsigned long ans{0}, n{0}, m{0}, nm{0};
    for(unsigned long i = 0; i < N; ++i){
        string s;
        cin >> s;
        bool p = 0;
        for(const auto c : s){
            if(p && c == 'B')++ans;
            p = (c == 'A');
        }
        if(s[0] == 'B')++n;
        if(s.back() == 'A')++m;
        if(s[0] == 'B' && s.back() == 'A')++nm;
    }
    if(n == nm && m == nm)--n;
    cout << min(n, m) + ans << endl;
    return 0;
}