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 n,ans,s1,s2,s3;
char s[15];
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%s",s+1);
		int len=strlen(s+1);
		for(int i=1;i<len;i++)if(s[i]=='A'&&s[i+1]=='B')ans++;
		if(s[1]=='B'&&s[len]=='A')s3++;
		else if(s[1]=='B')s1++;
		else if(s[len]=='A')s2++;
	}
	if(s3)
	{
		ans+=s3-1;
		if(s1)s1--,ans++;
		if(s2)s2--,ans++;
	}
	cout<<ans+min(s1,s2)<<endl;
}