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,n) for(int i=0;i<n;i++)
int main(){
    long long n,ans=0,a=0,b=0,c=0,A,B;
    string s[200000];
    cin>>n;
    rep(i,n) cin>>s[i];
    rep(i,n)rep(j,s[i].size()-1) if(s[i][j]=='A'&&s[i][j+1]=='B') ans++;
    rep(i,n){
        if(s[i][0]=='B') b++;
        if(s[i][s[i].size()-1]=='A') a++;
        if(s[i][0]=='B'&&s[i][s[i].size()-1]=='A') c++;
    }
  if(c>0){
    A=a-c;B=b-c;c--;
    if(A>0) c++,A--;
    if(B>0) c++,B--;
    cout<<ans+min(A,B)+c;
  }
  else cout<<ans+min(a,b);
}
