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>
#include<string>
#include<algorithm>
using namespace std;
long long n,ans,a,b,c;
string s;
int main(){
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>s;
        int j=s.size();
        if(s[j-1]=='A')a++;
        if(s[0]=='B')b++;
        if(s[j-1]=='A' && s[0]=='B')c++;
        for(int k=0;k<j-1;k++){
            if(s.substr(k,2)=="AB")ans++;
        }
    }
    if(a+b==0){}
    else if(a==b && b==c)ans+=min(a,b)-1;
    else ans+=min(a,b);
    cout<<ans<<endl;
}
