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 <vector>
#include <string>
using namespace std;
signed main() {
	int ans = 0;
	int a[5], n; cin >> n;
	a[0] = 0; a[1] = 0; a[2] = 0; a[3] = 0;
	for (int i = 0; i < n; i++) {
		string s; cin >> s;
		a[(int)(s[0] == 'B') * 2 + (int)(s.back() == 'A')]++;
		for (int i = 0; i < s.size() - 1; i++)if (s[i] == 'A'&&s[i + 1] == 'B')ans++;
	}
	if (!a[1] && !a[2])ans += max(0, a[3] - 1);
	else if (a[1] == a[2])ans += a[3] + a[1];
	else ans += min(a[1], a[2]) + a[3];
	cout << ans << endl;
}