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;

const int N=10000,M=10;

int n,c[N+9][2],ans;
char s[M+9];

void into(){
  scanf("%d",&n);
  int c0=0,c1=0,flag=1;
  for (int i=1;i<=n;++i){
	scanf("%s",s+1);
	int m=strlen(s+1);
	for (int j=1;j<m;++j)
	  if (s[j]=='A'&&s[j+1]=='B') ++ans;
    c0+=s[1]=='B';c1+=s[m]=='A';
	if (s[1]=='B'^s[m]=='A') flag=0;
  }
  ans+=min(c0,c1);
  if (c0&&c1) ans-=flag;
}

void work(){
}

void outo(){
  printf("%d\n",ans);
}

int main(){
  into();
  work();
  outo();
  return 0;
}