Problem:
Score : 400 points

Problem Statement

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.

Sample Input 1

3
ABCA
XBAZ
BAD

Sample Output 1

2

For example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.

Sample Input 2

9
BEWPVCRWH
ZZNQYIJX
BAVREA
PA
HJMYITEOX
BCJHMRMNK
BP
QVFABZ
PRGKSPUNA

Sample Output 2

4

Sample Input 3

7
RABYBBE
JOZ
BMHQUVA
BPA
ISU
MCMABAOBHZ
SZMEHMA

Sample Output 3

4

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define rep(i,a,b) for(int i = (a); i < (b); i++)
using namespace std;
typedef long long int ll;
typedef complex<double> com;
typedef pair<ll, ll> P;
const int mod = 1e9 + 7;
const int MOD = 998244353;
const int inf = 2e9;



int main() {
	int n; cin >> n;
	vector<string> a(n);
	rep(i, 0, n) {
		cin >> a[i];
	}
	int ans = 0;
	rep(i, 0, n)rep(j, 0, a[i].size() - 1) {
		if (a[i][j] == 'A' && a[i][j + 1] == 'B') ans++;
	}
	int asum = 0,basum=0, bsum = 0;
	rep(i, 0, n) {
		if (a[i][0] == 'B' && a[i][a[i].size() - 1] == 'A') {
			basum++; continue;
		}
		if (a[i][0] == 'B') {
			bsum++; continue;
		}
		if (a[i][a[i].size() - 1] == 'A') {
			asum++; continue;
		}
	}
	int add=0;
	if (asum > 0 && bsum > 0) {
		add = min(asum,bsum);
		if (basum > 0) add += basum;
	}
	if (asum > 0 && bsum == 0 && basum > 0) {
		add = asum + basum - 1;
	}
	if (asum == 0 && bsum> 0 && basum > 0) {
		add = basum + bsum - 1;
	}
	printf("%d", ans + add);
	return 0;
}