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>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> mp;
#define inf 1e9


int main(){
	int n;
	cin>>n;
	int cnt=0;
	int ab=0,sb=0,ea=0;
	for(int i=0;i<n;i++){
		string s;
		cin>>s;
		for(int i=0;i<s.size();i++){
			if(s[i]=='A'&&s[i+1]=='B')cnt++;
		}
		if(s[0]=='B'&&s[s.size()-1] == 'A')ab++;
		else if(s[0]=='B')sb++;
		else if(s[s.size()-1] == 'A') ea++;
	}
	int res = abs(sb-ea);
	cnt+= min(sb,ea);
	if(ab!=0){
		cnt+=ab-1;
		if(ea!=0||sb!=0)cnt++;
	}
	cout<<cnt<<endl;


	return 0;
}
