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>
#include<string>
using namespace std;
typedef long long ll;
string s[11111];
int main(){
	int n,count=0,ba=0,a=0,b=0;
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>s[i];
		int len=s[i].size();
		for(int j=0;j<len-1;j++){
			if(s[i][j]=='A'&&s[i][j+1]=='B') count++;
		}
		if(s[i][0]=='B'&&s[i][len-1]=='A') ba++;
		else if(s[i][0]=='B') b++;
		else if(s[i][len-1]=='A') a++;
	}
	int c=min(a,b);
	if(a==0&&b==0&&ba>0) ba--;
	cout<<count+c+ba<<endl;
}