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<algorithm>
using namespace std;
string s;
int A,B,ALL,n,ans;
int main(){
	cin>>n;
	for(register int i=1;i<=n;i++){
		cin>>s;
		for(register int i=0;i<s.length()-1;i++)if(s[i]=='A'&&s[i+1]=='B')ans++;
		if(s[0]=='B'&&s[s.length()-1]=='A')ALL++;
		else if(s[0]=='B')B++;
		else if(s[s.length()-1]=='A')A++;
	}
	if(ALL){
		ans+=--ALL;
		if(A){
			ans++;
			--A;
		}
		if(B){
			ans++;
			--B;
		}
	}
	printf("%d",ans+min(A,B));
}