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>
typedef long long ll;
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
using namespace std;
ll N;
string s;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>N;
	ll ans=0,x,y,z;
	x=y=z=0;
	REP(i,N){
		cin>>s;
		REP(i,s.size()-1){
			if(s[i]=='A' && s[i+1]=='B'){
				ans++;
			}
		}
		if(s.front()=='B' && s.back()=='A'){
			z++;
		}else if(s.front()=='B'){
			y++;
		}else if(s.back()=='A'){
			x++;
		}
	}
	if(x==0 && y==0){
		ans+=max(z-1,0ll);
	}else{
		ans+=min(x+z,y+z);
	}
	cout<<ans<<endl;
}