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 int ll;
int main(){
  ll n,ans=0;
  cin >>n;
  string s[n];
  ll aa=0,bb=0,k=0,fl=0;
  for(ll i=0;i<n;i++) {
    cin >>s[i];
    ll ss=s[i].size();
    if(s[i][ss-1]=='A'&&s[i][0]=='B') fl++;
    if(s[i][ss-1]=='A') aa++;
    if(s[i][0]=='B') bb++;
    for(ll j=0;j<ss-1;j++){
      if(s[i][j]=='A'&&s[i][j+1]=='B'){
            k++;
            j++;
      }
    }
  }
  if(aa==bb&&fl==aa) {
    if(aa==0) cout <<k<<endl;
    else cout <<k+aa-1<<endl;
  }
  else cout <<k+min(aa,bb)<<endl;
}
