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<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n,a,b,c,ans=0;
char s[100];
int main(){
	scanf("%d",&n);
	for(register int i=1;i<=n;i++){
		scanf("%s",s);
		int len=strlen(s);
		for(register int j=1;j<len;j++){
			if(s[j]=='B'&&s[j-1]=='A')ans++;
		}
		if(s[0]=='B'&&s[len-1]=='A'){
			c++;
			continue;
		}
		if(s[0]=='B')b++;
		if(s[len-1]=='A')a++;
	}
	if(c){
		c--;
		if(a)c++,a--;
		if(b)c++,b--;
		printf("%d\n",ans+c+min(a,b));
	}
	else{
		printf("%d\n",ans+min(a,b));
	}
	
	return 0;
} 