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 main() {
	int N,l,ba=0,b=0,a=0,r=0;
	string S;
	cin >> N;

	rep(i,N) {
		cin >> S;
		l = S.size();

		rep(j,l-1)
			if(S.substr(j,2) == "AB")
				++r;

		if(S.at(0)=='B' && S.at(l-1)=='A')
			++ba;
		else if(S.at(0) == 'B')
			++b;
		else if(S.at(l-1) == 'A')
			++a;
	}

	cout << r+min(b,a)+ba+(-1)*(ba>0&&b+a==0) << endl;
}