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,ans=0,cnt[2][2];
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		string s;cin>>s;
		for(int j=0;j+1<(int)s.size();j++) if(s[j]=='A'&&s[j+1]=='B') ans++;
		cnt[s[0]=='B'][s[s.size()-1]=='A']++;
	}
	if(cnt[1][1])
	{
		ans+=cnt[1][1]-1;
		if(cnt[1][0]) cnt[1][0]--,ans++;
		if(cnt[0][1]) cnt[0][1]--,ans++;
	}
	ans+=min(cnt[1][0],cnt[0][1]);
	cout<<ans<<endl;
}