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;

  int startb=0, enda=0, inab=0;
  bool loop=true;
  for(int i=0; i<n; ++i){
    string s; cin>>s;
    int x=s.size();
    if(s[0]=='B'){
      ++startb;
      if(s[x-1]!='A')loop=false;
    }
    if(s[x-1]=='A'){
      ++enda;
      if(s[0]!='B')loop=false;
    }
    for(int j=0; j<x-1; ++j){
      if(s[j]=='A' && s[j+1]=='B')++inab;
    }
  }

  int ans=0;
  if(startb==enda && startb>0 && loop)ans=inab+startb-1;
  else ans=inab+min(startb, enda);
  cout<<ans<<endl; 
}
