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;
#define rep(i,n) for(int i=0; i<(n); i++)
int n, f, b, ans, t = true;
string s;
int main(){
	scanf("%d", &n);
	rep(i,n){
		cin >> s;
		bool a = false;
		for(char c: s){
			if(c == 'A') a = true;
			else if(c == 'B' && a){
				a = false;
				ans++;
			}else a = false;
		}
		if(a) b++;
		if(s[0] == 'B') f++;
		if(b != f) t = false;
	}
	if(b == 0 || f == 0) t = false;
	printf("%d\n", ans + min(f, b) - t);
}