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;
typedef long long ll;
const int mod = 1e9 + 7;
int main(){
    int n;
    cin>>n;
    ll a=0,b=0,ab=0;
    ll ans=0;
    for(int i=0;i<n;i++){
        string s;
        cin>>s;
        for(int j=1;j<s.size();j++){
            if(s.at(j-1)=='A'&&s.at(j)=='B')ans++;
        }
        if(s.at(s.size()-1)=='A'&&s.at(0)=='B')ab++;
        else if(s.at(0)=='B')b++;
        else if(s.at(s.size()-1)=='A')a++;
    }
if(ab==0)ans+=min(a,b);
else if(a+b>0)ans+=ab+min(a,b);
else ans+=ab-1;
    cout<<ans<<endl;
}