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(){
	int N,ans=0;
	int sum1=0,sum2=0,sum3=0;
	char s[100];
	scanf("%d",&N);
 
	for(int i=0;i<N;i++){
		scanf("%s",s);
		int len=strlen(s);
		for(int j=1;j<len;j++){
			if(s[j-1]=='A'&&s[j]=='B')
				ans++;
		}
		if(s[0]=='B'&&s[len-1]=='A')
			sum3++;
		else if(s[0]=='B')
			sum1++;
		else if(s[len-1]=='A')
			sum2++;
	}
	ans+=min(sum1,sum2);
	if(sum1==0&&sum2==0&&sum3){
		sum3--;
	}
	ans+=sum3;
	cout<<ans<<endl;
	
	
	return 0;
}