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 m,n,i,w,x,y,z,t;
  string str;
  t=0;
  x=0;
  y=0;
  z=0;
  cin>>n;
  for(i=0; i<n; i++){
    cin>>str;
    w=str.size();
    if(str.at(w-1)=='A'&&str.at(0)=='B'){
      z++;
    }
    else if(str.at(0)=='B'){
      x++;
    }
    else if(str.at(w-1)=='A'){
      y++;
    }
      for(m=0; m<w-1; m++){
      if(str.at(m)=='A'&&str.at(m+1)=='B'){
        t++;
        
      }
    }
  }
  
  if(x+y==0&&z>0){
    t=t+z-1;
  }
  else if(x>=y){
    t=t+y+z;
  }
  else{
    t=t+x+z;
  }
  cout<<t;
}