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>
#define ll long long
#define rep(i,l,r) for(int (i)=(l);(i)<(r);i++)
#define erep(i,l,r) for(int (i)=(l);(i)<=(r);i++)
#define MOD 1000000007
using namespace std;
int main(){
    int n,ans=0,a=0,b=0,c=0;
    cin>>n;
    rep(i,0,n){
        string s;
        cin>>s;
        rep(j,0,(int)s.length()-1) if(s[j]=='A'&&s[j+1]=='B')ans++;
        if(s[0]=='B'){
            if(s[s.length()-1]=='A')c++;
            else b++;
        }
        else if(s[s.length()-1]=='A')a++;
    }
    if(a+b==0&&c>0)c--;
    cout<<ans+c+min(a,b)<<endl;
}