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;
string a[10005];
int cnt;
int cnta,cntb;
int cntab;
int main(){
	int n;
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>a[i];
		for(int j=0;j<a[i].length()-1;j++){
			if(a[i][j]=='A'&&a[i][j+1]=='B'){
				cnt++;
			}
		}
		if(a[i][0]=='B'){
			cntb++;
//			cout<<"B"<<endl;
		}
		if(a[i][a[i].length()-1]=='A'){
			cnta++;
		}
		if(a[i][0]=='B'&&a[i][a[i].length()-1]=='A'){
			cntab++;
		}
	}
	cnt+=min(cnta,cntb);
	if(cntab==cnta&&cntab==cntb&&cntab!=0){
		cnt--;
	}
	cout<<cnt;
	return 0;
}