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 lint;
using pi = pair<lint, lint>;
const int MAXN = 100005;

int st[MAXN], ed[MAXN];
int dap;

int main(){
	int n; cin >> n;
	int wtf = 0;
	for(int i=0; i<n; i++){
		string s; cin >> s;
		for(int j=1; j<s.size(); j++){
			if(s[j-1] == 'A' && s[j] == 'B') dap++;
		}
		st[s[0]]++;
		ed[s.back()]++;
		if(s[0] == 'B' && s.back() == 'A') wtf++;
	}
	dap += min(ed['A'], st['B']);
	if(wtf && ed['A'] == wtf && st['B'] == wtf) dap--;
	cout << dap << endl;
}
