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>

using namespace std;
int main(){
	int i,j,n,cnt = 0,x = 0,y = 0,z = 0;
	cin >> n;
	for(i=0;i<n;i++){
		string s;
		cin >> s;
		int k = s.size();
		for(j=0;j<k - 1;j++){
			if(s[j]=='A' && s[j+1]=='B'){
				cnt++;
			}
		}
		if(s[0]=='B'&& s[k-1]=='A') x++;
		else if(s[0]=='B') y++;
		else if(s[k-1]=='A') z++;
	}
	if(x>0){
		if(y>0 || z>0){
			cnt += x;
		}else{
			cnt += x - 1;
			cout << cnt << endl;
			return 0;
		}
	}
	cout << cnt + min(y,z) << endl;
}