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,cut[3],ans;//0为A 1为B 2为BA
char s[15]; 
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%s",s+1);
		int l=strlen(s+1);
		for(int j=2;j<=l;j++) if(s[j-1]=='A'&&s[j]=='B') ans++;
		if(s[1]=='B'&&s[l]=='A') cut[2]++;
		else if(s[1]=='B') cut[1]++;
		else if(s[l]=='A') cut[0]++;
	}
	ans+=(cut[2]?cut[2]-1:0);
	if(cut[2]&&cut[1]) cut[1]--,ans++;
	if(cut[2]&&cut[0]) cut[0]--,ans++;
	ans+=min(cut[0],cut[1]);
	printf("%d\n",ans);
}