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>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;

int main()
{
	int n;
	cin >> n;

	int a=0, b=0, ab=0, cnt=0;
	REP(i, n) {
		string s;
		cin >> s;

		if (s.at(0) == 'B' && s.at(s.size()-1) == 'A')	ab++;
		else if (s.at(0) == 'B')	b++;
		else if (s.at(s.size()-1) == 'A')	a++;

		REP(j, s.size()-1) {
			if (s.at(j) == 'A' && s.at(j+1) == 'B') cnt++;
		}
	}
	if (a == 0 && b == 0)	cout << min(a, b) + max(ab-1, 0) + cnt << endl;
	else cout << min(a, b) + ab + cnt << endl;
}
