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<string>
using namespace std;
int main()
{
	int n,len,x=0;
	int nA=0,nB=0,nAB=0;
	cin>>n;
	while(n--)
	{
		string arr;
		cin>>arr;
		len=arr.size();
		for(int i=0;i<len-1;i++)
		{
			if(arr[i]=='A'&&arr[i+1]=='B')
				nAB++;
		}
		if(arr[0]=='B')
			nB++;
		if(arr[len-1]=='A')
			nA++;
		if(arr[0]=='B'&&arr[len-1]!='A'||arr[0]!='B'&&arr[len-1]=='A')
			x=1;
	}
	if(x==0&&nA>0)
		nA--;
	cout<<nAB+min(nA,nB);
	return 0;
}