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

using namespace std;

int main() {
	int n; cin >> n;
	int cnt = 0, a = 0, b = 0, ab = 0;
	for (int i = 0; i < n; ++i) {
		string s; cin >> s;
		bool f = false;
		for (int j = 0; j < s.size() - 1; ++j)
			if (s.substr(j, 2) == "AB") ++cnt;
		if (s.back() == 'A') ++a, f = true;
		if (s.front() == 'B') ++b;
		else f = false;
		if (f) ++ab;
	}
	cout << max(0, cnt + min(a, b) - (ab && ab == a && ab == b ? 1 : 0)) << endl;

	return 0;
}