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