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)

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);
	int n;
	cin>>n;
	int ans=0;
	int a=0,b=0,c=0;
	while(n--){
		string s;
		cin>>s;
		for(int i=0;i<=(int)s.size()-2;i++){
			if(s[i]=='A' && s[i+1]=='B') ans++;
		}
		if(s[0]=='B' && s[s.size()-1]=='A') c++;
		if(s[0]=='B' && s[s.size()-1]!='A') b++;
		if(s[s.size()-1]=='A' && s[0]!='B') a++;
	}
	if(c!=0){
		ans+=c-1;
	if(a>0){
		ans++; a--;
	}
	if(b>0){
		ans++; b--;
	}
	ans+=min(a,b);
	}
	else{
		ans+=min(a,b);
	}
	cout<<ans+min(a,b);
}