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>
#define ll long long int
using namespace std;
char ch[10006][11];
int min(int a,int b)
{
	if(a>b)return b;
	return a;
}
int main(){
 	int sum=0,a=0,b=0,s=0,n;
 	cin>>n;
 	for(int i=0;i<n;++i)
 	{
 		cin>>ch[i];
 		if(ch[i][0]=='B')b++;
 		if(ch[i][strlen(ch[i])-1]=='A')a++;
 		if(ch[i][0]=='B'&&ch[i][strlen(ch[i])-1]=='A')s++;
 		for(int j=0;j<strlen(ch[i]);++j)
 		{
 			if(ch[i][j]=='A'&&ch[i][j+1]=='B')sum++;
		 }
	 }
	 if(s!=0&&s==b&&s==a)sum+=s-1;
	 else sum+=min(a,b);
	 cout<<sum;
}