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"
#define rep(i,a,n) for(int i=a;i<n;i++)
using namespace std;
using ll=long long;
const int M=100010;


int main(){
	int n,fin_a=0,first_b=0,ans=0;
	int tmp=0;
	string s;
	cin>>n;
	rep(i,0,n){
		bool x=false,y=false;
		cin>>s;
		if(s[s.size()-1]=='A')fin_a++,x=1;
		if(s[0]=='B')first_b++,y=1;
		if(x==1&&y==1)tmp++;
		rep(j,1,s.size()){
			if(s[j-1]=='A'&&s[j]=='B')ans++;
		}
	}
	if(tmp==fin_a&&tmp==first_b&&tmp!=0)ans+=tmp-1;
	else ans+=min(fin_a,first_b);
	cout<<ans<<endl;

}