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;
typedef unsigned long long ll;
const int mod=998244353;
int a[1000010];
int main()
{
	int n;
	cin >>n;
	int sum=0;
	int a=0,b=0;
	int cot=0;
	while(n--)
	{
		string s;
		cin >>s;
		int len=s.size();
		if(s[0]=='B'&&s[len-1]=='A') cot++;
		else
		{
			if(s[0]=='B') b++;
			else if(s[len-1]=='A') a++;
		}
		
		for(int i=1;i<len;i++)
		{
			if(s[i]=='B'&&s[i-1]=='A') sum++;
		}
	} 
	if(cot>0)
	{
		if(b==0) sum+=cot-1,b++;
		else sum+=cot;
	 } 
	sum+=min (a,b);
	cout <<sum<<endl;
	return 0;
}