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

int main()
{
	int n;
	cin >> n;
	int a = 0, b = 0, cnt = 0;
	bool head = false;
	for(auto i = 0; i < n; ++i){
		string s;
		cin >> s;
		for(auto j = 0; j < (int)s.size() - 1; ++j){
			if(s[j] == 'A' && s[j + 1] == 'B') ++cnt;
		}
		if(s[0] == 'B') ++b;
		if(s[s.size() - 1] == 'A') ++a;
		if(s[0] != 'B' && s[s.size() - 1] == 'A') head = true;
	}
	cout << cnt + max(0, min(a, b - !head)) << endl;
	return 0;
}