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>
using namespace std;
int main()
{
	int n,flag=0;
	cin >> n;
	string s ;
	int f1=0,f2=0,f3=0;
	for(int i=0;i<n;i++) {
		cin >> s;
		if(s[0]=='B'&&s[s.size()-1]=='A') f3++;
		else if(s[0]=='B') f2++;
		else if(s[s.size()-1]=='A') f1++;
		for(int j=0;j<s.size()-1;j++) {
			if(s[j]=='A'&&s[j+1]=='B') {
				flag++;
			}
		}
	}
	if(f1==0) {
		if(f2>0) flag+=f3;
		else if(f3>0) flag+=f3-1; 
	}
	else flag+=f3+min(f1,f2) ;
	cout << flag;
 	return 0;
}