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,ans=0,na=0,nb=0,c=1;
    string temp;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>temp;
        if(temp.front()=='B'){
            nb++;
            if(temp.back()!='A'){c=0;}
        }
        if(temp.back()=='A'){na++;}
        for(int j=0;j<temp.size()-1;j++){
            if(temp[j]=='A'){
                if(temp[j+1]=='B'){ans++;}
            }
        }
    }
    if(na==nb && na>0 && c==1){ans+=min(na,nb)-1;}
    else{ans+=min(na,nb);}
    cout<<ans<<endl;
}
