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 main()
{
	string str;
	int n,ans=0,a=0,b=0,ba=0;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>str;
		for(int j=0;j<str.size()-1;j++)
		if(str[j]=='A'&&str[j+1]=='B')
		ans++;
		if(str[0]=='B')
		a++;
		if(str[str.size()-1]=='A')
		b++;
		if(str[str.size()-1]=='A'&&str[0]=='B')
		ba++;
	}
	ans+=min(a,b);
	if(ba==a&&ba==b&&ba!=0)
	ans--;
	cout<<ans;
	return 0;
}