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>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;

int N, ans, numA, numB, numBA;

int main() {
    cin >> N;
    string s;
    rep(i, N) {
        cin >> s;
        if (s[0] == 'B' && s[s.size()-1] == 'A') numBA++;
        else if (s[0] == 'B') numB++;
        else if (s[s.size()-1] == 'A') numA++;
        rep(j, s.size() - 1) {
            if (s[j] == 'A' && s[j+1] == 'B') ans++;
        }
    }
    ans += numBA + min(numA, numB);
    if (numBA && numA + numB == 0) ans--;
    cout << ans << endl;
}