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;
#define maxn 10010
char str[maxn];
int n,m,i,s=0,s1=0,s2=0,s3=0;
int main()
{
	scanf("%d",&n);
	for (;n;n--)
	{
		scanf("%s",str);
		m=strlen(str);
		for (i=0;i<m-1;i++)
			if ((str[i]=='A') && (str[i+1]=='B')) s++;
		if ((str[m-1]=='A') && (str[0]=='B')) s3++;
			else if (str[m-1]=='A') s1++;
				else if (str[0]=='B') s2++;
	}
	if (s3 && !s1) s1++,s3--;
	if (s3 && !s2) s2++,s3--;
	printf("%d\n",s+min(s1,s2)+s3);
	return 0;
}