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;
    string s;
    int ab=0,ba=0,a=0,b=0,ss;
    for (int i=0;i<N;i++) {
        cin >> s;
        ss = s.size();
        for (int j=0;j<ss-1;j++) {
            if (s[j]=='A' && s[j+1]=='B') ab++;
        }
        if (s[0]=='B' && s[ss-1]=='A') ba++;
        if (s[0]=='B') b++;
        if (s[ss-1]=='A') a++;
    }
    int ans = ab + min(a,b) - (ba>1 && a==ba && b==ba ? 1 : 0);
    cout << ans << '\n';
    return 0;
}