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;
int main() {
  ll n;

	cin>>n;
	ll ans=0,cnt[3]={};
	for(int i=0;i<n;i++){
		string s;
		cin>>s;
		if(s[0]=='B'){
			if(s[s.size()-1]=='A')cnt[0]++;
			else cnt[2]++;
		}else if(s[s.size()-1]=='A')cnt[1]++;
		for(int j=0;j<s.size();j++){
			if(j){
				if(s[j-1]=='A'&&s[j]=='B')ans++;
			}
		}
	}
	//cout<<ans<<endl;
	if(cnt[1]&&cnt[2]){
		ans+=cnt[0]+1;
		cnt[1]--;
		cnt[2]--;
		ans+=min(cnt[1],cnt[2]);
	}else if(cnt[1]==0&&cnt[2]==0)ans+=max(0ll,cnt[0]-1);
	else ans+=cnt[0];
	cout<<ans<<endl;
	return 0;
}
