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 rep(i,x,y) for (int i=(x);i<=(y);i++)

using namespace std;

const int N=1e4+10;
int n,l,ans,a,b,ba; char s[N];

int main(){
	scanf("%d",&n);
	rep (i,1,n){
		scanf("%s",s+1),l=strlen(s+1);
		if (s[1]=='B'&&s[l]=='A') ba++;
		else if (s[1]=='B') b++;
		else if (s[l]=='A') a++;
		rep (j,1,l-1) if (s[j]=='A'&&s[j+1]=='B') ans++;
	}
	ans+=min(a,b)+ba;
	if (!a&&!b&&ba) ans--;
	printf("%d\n",ans);
	return 0;
}