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 int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define elif else if
using namespace std;
int a=0,b=0,c=0,d,n,sa[1];
string s[11000];
signed main()
{
	cin>>n;
	rep(i,n){
		cin>>s[i];
		rep(j,s[i].size()-1){
			if(s[i][j]=='A'&&s[i][j+1]=='B'){
				a++;
			}
		}
		if(s[i][s[i].size()-1]=='A'){
			b++;
		}
		if(s[i][0]=='B'){
			c++;
		}
	}
	if((b==0&&c==0)||b!=c){
		cout<<a+min(b,c);
		return 0;
	}else{
		rep(i,n){
			if(s[i][0]=='B'&&s[i][s[i].size()-1]!='A'){
				cout<<a+min(b,c);
				return 0;
			}
		}
		cout<<a-1+min(b,c);
	}
}