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 r(i,n) for(int i=0;i<n;i++)
#define int long long
using namespace std;
typedef pair<int,int>P;
#define fi first
#define se second

int dy[]={-1,0,1,0};
int dx[]={0,1,0,-1};

signed main(){
	int n;
	cin>>n;
	int sum=0,a=0,b=0,c=0;
	r(i,n){
		string s;
		cin>>s;
		r(j,s.size()-1){
			if(s[j]=='A'&&s[j+1]=='B')sum++;
		}
		if(s[s.size()-1]=='A' && s[0]=='B')c++;
		else if(s[0]=='B')b++;
		else if(s[s.size()-1]=='A')a++;
	}

	int x=c-1;
	x=max(x,0LL);
	if(c&&b)x++,b--;
	if(c&&a)x++,a--;
	x+=max(0LL,min(a,b));
	cout<<sum+x<<endl;
}