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<algorithm>
#include<cstring>
using namespace std;
char s[10005];
int n,num,n1,n2,n3;
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%s",s+1);
		int l=strlen(s+1);
		for(int j=2;j<=l;j++)
		  if(s[j]=='B'&&s[j-1]=='A')
		    num++;
		if(s[1]=='B'&&s[l]=='A')n3++;
		else if(s[1]=='B')n2++;
		else if(s[l]=='A')n1++;
	}
	if(n1==0&&n2==0)
	{
		if(n3)num+=n3-1;
		printf("%d\n",num);
		return 0;
	}
	num+=n3;
	num+=min(n1,n2);;
	printf("%d\n",num);
}