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
const ll MOD=1e9+7;
using namespace std;

int main(){
    ll N,AB=0,A=0,B=0,cnt=0;
    cin>>N;
    for(ll i=0;i<N;i++){
        string s;
        cin>>s;
        ll a=s.size();
        for(ll j=0;j+1<a;j++){
            if(s[j]=='A'&&s[j+1]=='B') cnt++;
        }
        if(s[0]=='B'&&s[a-1]=='A') AB++;
        else if(s[0]=='B') B++;
        else if(s[a-1]=='A') A++;
    }
    if(A!=0||B!=0) cnt+=min(A,B)+AB;
    else if(AB>0)cnt+=AB-1;
    cout<<cnt<<endl;
}