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>
#define maxn 10000
using namespace std;
int n,cnt=0;
string s[maxn];
vector<string> v;
int a=0,b=0,c=0;
int main()
{
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>s[i];
		for(int j=0;j<=s[i].size()-2;j++)
			if(s[i].substr(j,2)=="AB")
				++cnt;
		string t="";
		if(s[i][0]=='B'&&s[i][s[i].size()-1]=='A')
			c++;
		else if(s[i][0]=='B')
			a++;
		else if(s[i][s[i].size()-1]=='A')
			b++;
	}
	cnt+=min(a,b);
	cnt+=c;
	if(a==0&&b==0&&c!=0)
		--cnt;
	cout<<cnt<<endl;
	return 0;
}