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 <string>
#include <functional>
#include <algorithm>

using namespace std;

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

	int cnt = 0;
	int a = 0;
	int b = 0;

	bool flag = 1;

	for (int i = 0; i < n; i++)
	{
		string s;
		cin >> s;

		int idx = s.find("AB");

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

		if ((s.at(0) == 'B') ^ (s.at(s.size() - 1) == 'A'))
			flag = 0;

		while (idx != string::npos)
		{
			cnt++;
			s = s.substr(idx + 2);
			idx = s.find("AB");
		}

	}

	cout << cnt + max(min(a,b) - flag, 0)<< endl;

	return 0;
}