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