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 long long ll;
const int maxn = 1e7+5;

int main(){
	int n,sum=0,a=0,b=0,c=0;
	cin>>n;
	for(int i=1;i<=n;i++){
		string s;
		cin>>s;
		int l=s.size();
		if(s[0]=='B') b++;
		if(s[l-1]=='A') a++;
		if(s[0]=='B'&&s[l-1]=='A') c++;
		for(int j=1;j<l;j++){
			if(s[j-1]=='A'&&s[j]=='B') sum++;
			//cout<<sum<<" "<<b<<" "<<a<<endl;
		}
	}
	if(b==c&&a==c&&c!=0) sum--;
	cout<<sum+min(a,b)<<endl;
	return 0;
}