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 pair<int,int> pii;
int n,ans,x,y,z;
string s;
int main(){
	cin >> n;
	for(int i=0;i<n;i++){
		cin >> s;
		if(s[0]=='B')x++;
		if(s[s.size()-1]=='A')y++;
		if(s[0]=='B' and s[s.size()-1]=='A')z++;
		for(int j=0;j<s.size()-1;j++)
			if(s[j]=='A' and s[j+1]=='B')ans++;
	}
	if(x==z and y==z and x!=0)x--;
	cout << ans+min(x,y);
    return 0;
}