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>

int main()
{
	int N;
	scanf("%d", &N);
	int count[3]{}, sum{};
	for (int i{}; i < N; i++)
	{
		std::string s;
		std::cin >> s;
		for (int j{}; j + 1 < (int)s.size(); j++)
			if (s[j] == 'A' && s[j + 1] == 'B')
				sum++;
		if (s.front() == 'B' && s.back() == 'A')
			count[0]++;
		else if (s.front() == 'B')
			count[1]++;
		else if (s.back() == 'A')
			count[2]++;
	}
	if (count[1] || count[2])
		sum += count[0];
	else if (count[0])
		sum += count[0] - 1;
	
	sum += std::min(count[1], count[2]);
	printf("%d\n", sum);

	return 0;
}