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 cnt, n, ab, a, b;
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		string s;
		cin >> s;
		for (int j = 1; j < s.size(); j++)
			if (s[j] == 'B' && s[j-1] == 'A')
				cnt++;
		if (s[0] == 'B' && s[(int)s.size() - 1] == 'A')
			ab++;
		else if (s[0] == 'B')
			b++;
		else if (s[(int)s.size() - 1] == 'A')
			a++;
	}
//	cout << a << ' ' << b << ' ' << ab << endl;
	if (!a && !b) {
		cout << cnt + max(0, ab - 1);
	}
	else if (!a || !b) {
		cout << cnt + ab;
	}
	else
		cout << cnt + ab + min(a, b);
	cout << endl;
}