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()
{
	int n;int a=0,b=0,ab=0;int count=0;
	string ss;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>ss;
		int len=ss.length();
		if(ss[0]=='B') b++;
		if(ss[len-1]=='A') a++;
		if(ss[0]=='B'&&ss[len-1]=='A') ab++;
		for(int j=1;j<len;j++)
		{
			if(ss[j]=='B'&&ss[j-1]=='A')count++;
		}
	}
	if(a==b&&b==ab&&b!=0) count--;
	cout<<count+min(a,b)<<endl;
	return 0;
}