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;
const int maxn = 1e5+10;
int main()
{
	int n;
	cin >> n;
	string s[maxn];
	int a[3];
	memset(a,0,sizeof(a));
	int cnt = 0;
	for(int i = 0;i < n;i ++){
		cin >> s[i];
		int l =s[i].size();
		for(int j = 1;j < l;j ++){
			if(s[i][j - 1] =='A' && s[i][j] == 'B'){
				cnt ++;
			}
		}
		if(s[i][0] == 'B') a[0] ++;
		if(s[i][l-1] == 'A') a[1]++;
		if(s[i][l-1] == 'A' && s[i][0] =='B') a[2] ++;
	}
	if(a[0] < a[1])  cnt += a[0];
	else cnt += a[1];
	if(a[0] == a[1] && a[1] == a[2] && a[2] != 0) cnt --;
	cout << cnt << endl;
	return 0;
}