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>

using namespace std;

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