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 <iostream>
#include <string>
#include <algorithm>
using namespace std;

int N, A, B, C, T; string S[100009];

int main() {
	cin >> N;
	for (int i = 0; i < N; i++) {
		cin >> S[i];
		for (int j = 0; j < (int)S[i].size() - 1; j++) {
			if (S[i].substr(j, 2) == "AB") T++;
		}
		if (S[i][0] == 'B' && S[i][S[i].size() - 1] == 'A') C++;
		if (S[i][0] != 'B' && S[i][S[i].size() - 1] == 'A') A++;
		if (S[i][0] == 'B' && S[i][S[i].size() - 1] != 'A') B++;
	}
	
	if (A == 0 && B == 0) cout << T + max(0LL, C - 1LL) << endl;
	else cout << T + min(A, B) + C << endl;
	return 0;
}