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<iostream>
#include<cstring> 
using namespace std;
int main()
{
	char a[20];
	int n,A=0,B=0,C=0,ans=0;
	cin>>n;
	while(n--)
	{
		cin>>a;
		int len = strlen(a);
		if(a[0]=='B')
		B++;
		if(a[len-1]=='A')
		A++;
		if(a[0]=='B'&&a[len-1]=='A')
		C++;
		for(int i=0;i<len;i++)
		{
			if(a[i]=='A'&&a[i+1]=='B')
			ans++;
		}
	}
	int t;
	if(A>B) 
	t = B;
	else
	t = A;
	if(A == C&&B == C&&C!=0)
		ans--;
	cout<<ans+t;
	return 0;
}