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 A_cnt=0,B_cnt=0,BA_cnt=0,sum=0;

  for(int i=0;i<N;++i){
    string s;
    cin>>s;
    int n=s.size();
    if(s[0]=='B' && s[n-1]=='A') ++BA_cnt;
    else if(s[0]=='B') ++B_cnt;
    else if(s[n-1]=='A') ++A_cnt;
    for(int i=0;i<n-1;++i){
      if(s[i]=='A' && s[i+1]=='B') ++sum;
    }
  }

  if(A_cnt+B_cnt>0) cout<<sum+BA_cnt+min(A_cnt,B_cnt)<<endl;
  else{
    if(BA_cnt>0) cout<<sum+BA_cnt-1<<endl;
    else cout<<sum<<endl;
  }
  
}
