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,res=0,fb=0,la=0,wa=0;cin>>n;
    vector<string> s(n);
    for (int i = 0; i < n; i++) {
        cin>>s[i];
    }
    for (int i = 0; i < n; i++) {
        int len=s[i].length();
        if(s[i][0]=='B')fb++;
        if(s[i][len-1]=='A')la++;
        if(s[i][0]=='B' and s[i][len-1]=='A')wa++;
        for (int j = 1; j < len; j++) {
            if(s[i][j]=='B' and s[i][j-1]=='A')res++;
        }
    }
    if(fb==wa and la==wa and wa!=0) res+=wa-1;
    else res+=min(fb,la);
    cout<<res<<endl;
}
