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 main() {
	long long n,m,r,g,b,i,j,k,cur,ans=0,res,zero=0;

	cin >> n;
	vector<string> s(n);
	for(i=0; i<n; i++){
		cin >> s[i];
	}
	
	long long cura=0,curb=0,flag=0;
	for(i=0; i<n; i++){
		if(s[i][0]=='B'){
			curb++;
		}
		if(s[i][s[i].size()-1]=='A'){
			cura++;
			if(s[i][0]!='B'){
				flag++;
			}
		}
		for(j=1; j<s[i].size(); j++){
			if(s[i][j-1]=='A' && s[i][j]=='B'){
				ans++;
			}
		}
	}
	if(flag==0){
		curb=max(curb-1,zero);
	}
	cout << ans+min(cura,curb);

	return 0;
}
