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<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int n;
char s[111];

int main() {
	scanf("%d", &n);
	
	int first_b = 0, end_a = 0, ans=0, f = 1;
	for(int i=0;i<n;i++) {
		scanf("%s", s);
		int l = strlen(s);
		
		int x = 0;
		if(s[0]=='B') { first_b ++; x ++; }
		if(s[l-1] == 'A') { end_a ++; x ++; }
		if(x==1) f = false;
		
		for(int j=1;j<l;j++)
			if(s[j-1]=='A' && s[j]=='B') ans++;
	}
	ans += max(0, min(first_b, end_a)-f);
	printf("%d\n", ans);
	
	return 0;
}