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 int long long
const int INF = 200000000007;


  
signed main(){
    int n,ans=0;
    cin>>n;
    string s;
    int a=0,b=0,w=0;
    for(int i=0;i<n;i++){
        cin>>s;
        for(int j=1;j<s.size();j++){
            if(s[j-1]=='A'&&s[j]=='B')ans++;
            
        }
        if(s[0]=='B')b++;
            if(s[s.size()-1]=='A')a++;
            if(s[0]=='B'&&s[s.size()-1]=='A')w++;

    }
    if(a-w==0&&b-w==0)cout<<ans+max(w-1,0);
    else cout<<ans+w+min(a-w,b-w);

    return 0;
}