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>
#include <string>
#include <algorithm>

using namespace std;

int main(void) {
	int num, i = 0, j, a = 0, b = 0, ab = 0, ans = 0, buf;
	string s;
	cin >> num;
	for (; i < num; i++) {
		cin >> s;
		for (j = 0; j < s.size() - 1; j++) {
			if (s[j] == 'A' && s[j + 1] == 'B')
				ans++;
		}
		if (s[0] == 'B') {
			b++;
			if (s[s.size() - 1] == 'A') {
				a++;
				ab++;
			}
		}
		else if (s[s.size() - 1] == 'A')
			a++;
	}
	buf = min(a, b);
	if (buf > 0 && a == b && a == ab)
		buf--;
	printf("%d\n", ans + buf);
	return 0;
}