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<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,i,x=0,y=0,z=0,ans=0,m,j,tmp;
char s[15];
int main()
{
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		scanf("%s",s);
		m=strlen(s);
		for(j=0;j<m;j++)if(s[j]=='A'&&j+1<m&&s[j+1]=='B')ans++;
		if(s[0]!='B'&&s[m-1]=='A')x++; 
		if(s[0]=='B'&&s[m-1]!='A')y++; 
		if(s[0]=='B'&&s[m-1]=='A')z++; 
	}
	if(z==0)
	{
		ans+=min(x,y);
	}
	else
	{
		ans+=z-1;
		if(x>0)x--,ans++;
		if(y>0)y--,ans++;
		tmp=min(x,y);
		ans+=tmp;
	}
	printf("%d\n",ans);
	return 0;
}