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

int n, ans;
vector<string> v;
int a[4];

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cin >> n;
	v.resize(n);
	for(auto &i:v) cin >> i;
	for(auto i:v){
		int t = (i[0] == 'B') * 2 + (i[i.size()-1] == 'A');
		++a[t];
		for(int j=0; j<i.size()-1; ++j)
			if(i.substr(j, 2) == "AB")
				++ans;
	}
	if(a[3] >= 2) ans += a[3] - 1;
	if(a[3] >= 1){
		if(a[2] > 0){
			++ans;
			--a[2];
		}
		if(a[1] > 0){
			++ans;
			--a[1];
		}
	}
	ans += min(a[2], a[1]);
	cout << ans << "\n";
}