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;
typedef long long int ll;

int main() {
    int n;
    cin >> n;
    int cnt = 0;
    int a = 0,b = 0, ba = 0;
    for(int i = 0;i < n; i++) {
        string s;
        cin >> s;
        int m = s.size();
        for(int j = 0; j + 1 < m; j++) {
            if(s[j] == 'A' && s[j + 1] == 'B') cnt++;
        }
        if(s[0] == 'B') b++;
        if(s[m - 1] == 'A') a++;
        if(s[0] == 'B' && s[m - 1] == 'A') ba++;
    }
    cnt += min(a, b);
    if(a == ba && b == ba && b > 0) cnt--;
    cout << cnt << endl;
    return 0;
}
