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;
string s;
int n,ans,la,fb,abboth,aftera,afterb;
int main(){
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>s;
		int r=s.size();
		for(int y=0;y<(r-1);y++){
			if(s[y]=='A'&&s[y+1]=='B')ans++;
		}
		if(s[0]=='B'&&s[s.size()-1]=='A')abboth++;
		else if(s[s.size()-1]=='A')la++;
		else if(s[0]=='B')fb++;
	}
	if(abboth>1)ans+=(abboth-1);
	if(la>0&&fb>0){
		ans+=2;
		la-=1;
		fb-=1;
		ans+=min(la,fb);
	}else if((la>0&&fb==0)||(la==0||fb>0)){
		ans+=1;
	}

	cout<<ans<<endl;
}