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 ll;

int main() {
    int N; cin >> N;
    int topB = 0, botA = 0;
    ll ans = 0;
    bool non = true;
    for (int i = 0; i < N; i++) {
        string s; cin >> s;
        if (s[0] == 'B' ^ s[s.length()-1] == 'A') non = false;
        if (s[0] == 'B') topB++;
        if (s[s.length()-1] == 'A') botA++;
        for (int i = 0; i < s.length()-1; i++) {
            if (s[i] == 'A' && s[i+1] == 'B') ans++;
        }
    }
    cout << ans + (min(topB, botA)) - (int)(topB == botA && non && topB > 0) << endl;
}
