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 n,l[10010],ans;
char s[10010][15];
int a,b,c;

int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%s",s[i]+1);
		l[i]=strlen(s[i]+1);
		for(int j=1;j<l[i];j++){
			if(s[i][j]=='A'&&s[i][j+1]=='B') ans++;
		}
		if(s[i][1]=='B'){
			if(s[i][l[i]]=='A') a++;
			else b++;
		} 
		else{
			if(s[i][l[i]]=='A') c++;
		}
	}
	if(a==0) ans+=min(b,c);
	else if(b==0&&c==0) ans+=a-1;
	else if(b==0||c==0) ans+=a;
	else ans+=a+1+min(b,c)-1; 
	printf("%d\n",ans);
	
	return 0;
}