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>
#define pii pair<int,int>
#define F first
#define S second
#define mp make_pair
#define vi vector<int>
#define pb push_back
using namespace std;
const int N=1e4+5;
string s[N];
int n,ans,a,b,ba,last;
void tj(string t)
{
	int l=0,r=t.size()-1;
	if(t[l]=='B'&&t[r]=='A')ba++;
	if(t[r]=='A')a++;
	if(t[l]=='B')b++;
}
int main()
{
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>s[i];
		for(int j=0;j<s[i].size()-1;j++)
			if(s[i][j]=='A'&&s[i][j+1]=='B')
				ans++;
		tj(s[i]);
	}
	ans+=min(a,b);
	if(a==ba&&b==ba&&ba)ans--;
	cout<<ans<<endl;
	return 0;
}