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;
string s;
int a[3];
int ans = 0;

int main(){
	scanf("%d", &n);

	while(n--){
		cin >> ws;
		getline(cin, s);

		for(int i = 0; i < s.size() - 1; i++){
			if(s[i] == 'A' && s[i + 1] == 'B') ans++;
		}

		if(s[0] == 'B' && s.back() == 'A') a[2]++;
		else if (s[0] == 'B') a[1]++;
		else if (s.back() == 'A') a[0]++;
	}

	if(a[2] == 0) ans += min(a[0], a[1]);
	else {
		if(a[0] + a[1] != 0) ans += a[2] + min(a[0], a[1]);
		else ans += a[2] - 1;
	}

	printf("%d\n", ans);
	
	return 0;
}