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;
string s[10005];
int main()
{
	int n,ans=0,k=0,cnt1=0,cnt2=0,cnt3=0;
	cin>>n;
	for(int i=0;i<n;i++)
	 {cin>>s[i];
	  for(int j=0;j<s[i].size()-1;j++)
	   if(s[i][j]=='A'&&s[i][j+1]=='B')ans++;
	  if(s[i][0]=='B'&&s[i][s[i].size()-1]=='A')cnt1++;
	  else if(s[i][0]=='B')cnt2++;
	  else if(s[i][s[i].size()-1]=='A')cnt3++; 
	 } 
	ans+=min(cnt2,cnt3);
	if(!cnt2&&!cnt3)ans+=max(0,cnt1-1);
	else ans+=cnt1;
	cout<<ans<<endl;
}