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 rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

int main(){
	int n; cin>>n;

	int ans=0,cnt1=0,cnt2=0,cnt3=0;
	rep(i,n){
		string s; cin>>s;
		int len=s.length();
		rep(j,len-1) if(s[j]=='A' && s[j+1]=='B') ans++;
		if(s[0]=='B' && s[len-1]=='A') cnt1++;
		else if(s[  0  ]=='B') cnt2++;
		else if(s[len-1]=='A') cnt3++;
	}

	ans+=min(cnt2,cnt3);
	if(cnt2+cnt3>0) ans+=cnt1;
	else            ans+=max(cnt1-1,0);

	printf("%d\n",ans);

	return 0;
}
