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 main() {
	int N;
	cin >> N;
	int A = 0, B = 0, AB = 0, BA = 0;
	for (int i = 0; i < N; i++) {
		string s;
		cin >> s;
		A += (s.back() == 'A' && s.front() != 'B');
		B += (s.back() != 'A' && s.front() == 'B');
		BA += (s.back() == 'A' && s.front() == 'B');
		for (int j = 0; j < s.length() - 1; j++) AB += (s.substr(j, 2) == "AB");
	}
	while (BA > 0 && A != B) {
		(A < B ? A : B)++;
		BA--;
	}
	if (A == 0 && B == 0) BA--;
	cout << AB + min(A, B) + max(0, BA) << endl;
}