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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll,ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
int n,ans,a,b,c;
string s;
int main(void){
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>s;
		for(int j=0;j+1<s.size();j++){
			if(s[j]=='A'&&s[j+1]=='B')ans++;
		}
		if(s[0]=='B')b++;
		if(s[s.size()-1]=='A')a++;
		if(s[0]=='B'&&s[s.size()-1]=='A')c++;
	}
	if(a==c&&b>0)b--;
	cout<<ans+min(a,b)<<endl;
}