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>
using namespace std;

int sua, sbu, sba, n, ans;
string s;

int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> s;
		for (int j = 1; j < s.size(); j++)
			ans += (s[j - 1] == 'A' && s[j] == 'B');
		if (s[0] == 'B' && s.back() == 'A')
			sba++;
		else if (s[0] == 'B')
			sbu++;
		else if (s.back() == 'A')
			sua++;
	}
	if (sua > 0)
		ans += sba + min(sua, sbu);
	else if (sba > 0)
		ans += sba - 1 + (sbu > 0);
	cout << ans;
}