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<iostream>

using namespace std;

int main(){
  int i,j,n,ab=0,Bo=0,oA=0,BA=0;
  string buf;
  cin>>n;
  for(i=0;i<n;i++){
    cin>>buf;

    if(buf[buf.size()-1]=='A'){
      if(buf[0]=='B') BA++;
      else oA++;
    }
    else if(buf[0]=='B') Bo++;

    for(j=0;j<buf.size()-1;j++){
      if(buf.substr(j,2)=="AB"){
        ab++;
      }
    }
  }

  if(BA>0){
    ab=ab+BA-1;
    if(oA>0){
      ab++;
      oA--;
    }
    if(Bo>0){
      ab++;
      Bo--;
    }
  }

  if(Bo>oA) ab+=oA;
  else  ab+=Bo;

  cout<<ab<<endl;
  return 0;
}