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;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef long long ll;

int main(){
    ll N,cn=0,A=0,B=0,BA=0;cin>>N;
    string s[10010];
    rep(i,0,N){
        cin>>s[i];
        rep(j,0,s[i].size()-1){
            if(s[i].at(j)=='A'&&s[i].at(j+1)=='B')cn++;
        }
        if(s[i].at(0)=='B'&&s[i].at(s[i].size()-1)=='A')BA++;
        else if(s[i].at(0)=='B')B++;
        else if(s[i].at(s[i].size()-1)=='A')A++;
    }
    if(BA!=0&&B==0&&A==0)cn+=BA-1;
    else cn+=min(BA+A,BA+B);
    cout<<cn<<endl;
}





