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 main() {
	int N;
	cin >> N;
	int cntA = 0, cntB = 0, cntsame = 0;
	long long ans = 0;

	for (int i = 0; i < N; i++)
	{
		string tmp;
		cin >> tmp;
		int len = tmp.size();
		if (tmp[0] == 'B') cntB++;
		if (tmp[len - 1] == 'A') cntA++;
		if (tmp[0] == 'B' && tmp[len - 1] == 'A') cntsame++;
		for (int j = 0; j < len - 1; j++)
		{
			if (tmp[j] == 'A' && tmp[j + 1] == 'B') ans++;
		}
	}

	ans += min(cntA, cntB);
	if (cntA == cntB && cntA == cntsame && cntsame > 0) ans--;

	cout << ans << endl;
	return 0;
}
