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,x,y,z;
int main(){
	//freopen("input.txt","r",stdin);
	scanf("%d",&n);
	for(int i = 0;i < n;i++){
		string s;
		cin >> s;
		if(s[0] == 'B' && s.back() == 'A')x++;
		else if(s[0] == 'B')y++;
		else if(s.back() == 'A')z++;
		for(int j = 0;j + 1 < s.size();j++)
			if(s[j] == 'A' && s[j + 1] == 'B')ans++;
	}
	ans+=max(0,x - 1);
	if(x)x = 1;
	if(x && y && z)ans+=2,y--,z--,x = 0;
	ans+=min(y,z);
	int temp = min(y,z);
	y-=temp;
	z-=temp;
	ans+=min(x,y);
	ans+=min(x,z);
	cout << ans << endl;
}