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 main() {
	
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	
	int n; cin >> n;
	int cntA = 0, cntB = 0, cntAB = 0, cnt = 0;
	while (n--) {
		char buf[20]; cin >> buf;
		int len = strlen(buf);
		if (buf[0] == 'B') cntB++;
		if (buf[len - 1] == 'A') cntA++;
		if (buf[0] == 'B' && buf[len - 1] == 'A') cntAB++;
		for (int i = 1; i < len; i++) if (buf[i - 1] == 'A' && buf[i] == 'B') cnt++;
	}
	if (cntA == cntB && cntB == cntAB && cntAB) cnt += cntAB - 1;
	else cnt += min(cntA, cntB);
	cout << cnt << "\n";
	
	return 0;
}
