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,sz,BC=0,AC=0,BA=0,AB=0;
  cin>>N;
  string S;
  for(int i=0;i<N;i++){
    cin>>S;
    sz=S.size();
    if(S[0]=='B'){
      BC++;
    }
    if(S[sz-1]=='A'){
      AC++;
    }
    if(S[0]=='B'&&S[sz-1]=='A'){
      BA++;
    }
    for(int j=1;j<sz;j++){
      if(S[j-1]=='A'&&S[j]=='B')
        AB++;
    }
  }
  if(min(BC,AC)==0){
    cout<<AB<<endl;
  }else if(BC==BA&&AC==BA&&BA){
    cout<<BC-1+AB<<endl;
  }else{
    cout<<min(BC,AC)+AB<<endl;
  }
}