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(int argc, char const *argv[])
{
	int n;
	cin>>n;
	string s[n];
	int a=0,b=0,ans=0,f=1;
	for (int i = 0; i < n; ++i)
	{
		cin>>s[i];
		if (s[i].at(0)=='B')
		{
			++b;
		}
		if (s[i].at(s[i].size()-1)=='A')
		{
			++a;
		}
		if (a!=b)
		{
			f=0;
		}
		for (int j = 1; j < s[i].size(); ++j)
		{
			if (s[i].at(j-1)=='A'&&s[i].at(j)=='B')
			{
				++ans;
			}
		}
	}
	if (a==0&&b==0)
	{
		f=0;
	}
	cout<<ans+min(a,b)-f<<endl;
	return 0;
}
