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;
typedef long long ll;
int main(){
  ll n,i,j,m,c=0,ca=0,cb=0,cab=0;
  cin>>n;
  string s;
  for(i=0;i<n;i++){
	cin>>s;
    m=s.size();
    for(j=0;j<m-1;j++){
		if(s[j]=='A'&&s[j+1]=='B'){
          c++;
        }
    }
    if(s[0]=='B'&&s[m-1]!='A'){
	   cb++;
    }else if(s[m-1]=='A'&&s[0]!='B'){
       ca++;
    }else if(s[0]='B'&&s[m-1]=='A'){
	   cab++;
    }
  }

  if(cab==0){
    cout<<c+min(ca,cb)<<endl;
  }else{
    if(ca==0&&cb==0){
    cout<<c+cab-1<<endl;
    }else{
     cout<<c+cab+1+min(ca-1,cb-1)<<endl;
    }
  }
}
