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 int long long
using namespace std;

signed main() {
	bool kata = false;
	int n;
	cin >> n;
	vector<string> v(n);
	for (int i = 0; i < n; ++i)cin >> v[i];
	int ab = 0;
	int aend = 0;
	int bstart = 0;
	for (string s : v) {
		for (int i = 1; i < s.size(); ++i) {
			if (s[i - 1] == 'A' && s[i] == 'B')++ab;
		}
		if (s[0] == 'B') ++bstart;
		if (s.back() == 'A')++aend;
		if ((s[0] == 'B') ^ (s.back() == 'A'))kata = true;
	}
	if (kata)cout << ab + min(aend, bstart) << endl;
	else cout << ab + max(0ll, aend - 1) << endl;
}
