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 N;
long long res,B_,_A,BA;
int main()
{
	cin>>N;
	while(N--)
	{
		string S;
		cin>>S;
		long long cnt=0;
		for(int i=0;i<S.length()-1;i++)
			if(S[i]=='A'&&S[i+1]=='B')
				cnt++;
		res+=cnt;
		if(S[0]=='B'&&S[S.length()-1]=='A')
			BA++;
		else if(S[0]=='B')
			B_++;
		else if(S[S.length()-1]=='A')
			_A++;
	}
	long long res1=0;
	res1+=min(B_,_A);
	res1+=BA;
	if(!B_&&!_A&&BA)
		res1--;
	cout<<res+res1<<endl;
	return 0;
}