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 <algorithm>
#include <iostream>
#include <string>
using namespace std;

int main() {
	int N, A = 0, B = 0, BA = 0, ans = 0;
	cin >> N;
	for (int i = 0; i < N; ++i) {
		string s;
		cin >> s;
		for (int j = 0; j < s.size() - 1; ++j) {
			if (s[j] == 'A' && s[j + 1] == 'B') ++ans;
		}
		if (s[0] == 'B' && s[s.size() - 1] == 'A') ++BA;
		else if (s[0] == 'B') ++B;
		else if (s[s.size() - 1] == 'A') ++A;
	}
	if (BA != 0) {
		ans += BA - 1;
		if (A != 0) {
			--A;
			++ans;
		}
		if (B != 0) {
			--B;
			++ans;
		}
	}
	ans += min(A, B);
	cout << ans;
}