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<algorithm>
using namespace std;
int N,a,b,c;
long ans;
int main()
{
	cin>>N;
	for(int i=0;i<N;i++)
	{
		string s;cin>>s;
		for(int j=0;j+1<s.size();j++)
		{
			if(s[j]=='A'&&s[j+1]=='B')ans++;
		}
		if(s[0]=='B'&&s[s.size()-1]=='A')c++;
		else if(s[0]=='B')b++;
		else if(s[s.size()-1]=='A')a++;
	}
	if(a>0&&b>0)
	{
		ans+=c+1;
		c=0;
		a--,b--;
		ans+=min(a,b);
	}
	else if(a>0)
	{
		ans+=c;
	}
	else if(b>0)
	{
		ans+=c;
	}
	else
	{
		if(c>0)ans+=c-1;
	}
	cout<<ans<<endl;
}
