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=0, B_=0, B_A=0;
	int ans=0;
	for(int i=0;i<n;i++){
		string s;	cin>>s;
		for(int j=0;j+1<s.length();j++){
			if(s[j]=='A'&&s[j+1]=='B')ans++;
		}

		if(s[0]=='B'&&s[s.length()-1]=='A')B_A++;
		else if(s[0]=='B')B_++;
		else if(s[s.length()-1]=='A')_A++;
	}
	//printf("_A:%d\n",_A);
	//printf("B_:%d\n",B_);
	//printf("B_A:%d\n",B_A);
	if(B_A==0){
		ans+=min(_A,B_);
	}else if(_A==0 && B_==0){
		ans+=max(B_A-1,0);
	}else{
		ans+=min(_A,B_)+B_A;
	}

	cout<<ans<<endl;
	return 0;
}
