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 cntA,cntB,cntAB;
char s[15];
signed main(){
	int n,len,ans=0;
	cin>>n;
	for(int i=1;i<=n;++i){
		cin>>(s+1);len=strlen(s+1);
		for(int j=1;j<len;++j)
			ans+=(s[j]=='A' && s[j+1]=='B');
		if(s[1]=='B' && s[len]=='A') ++cntAB;
		else if(s[1]=='B') ++cntB;
		else if(s[len]=='A') ++cntA;
	}
	if(cntAB){
		ans+=cntAB-1+(cntA>0)+(cntB>0);
		if(cntA>0) --cntA;
		if(cntB>0) --cntB;		
	} 
	ans+=min(cntA,cntB);
	cout<<ans;
	return 0;
}