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 <stdio.h>
#include <string.h>
int main(){
  int N,i,j,a=0,b=0,c=0,d=0,m=0,ans=0;
  scanf("%d",&N);
  char s[N][11];
  for(i=0;i<N;i++)scanf("%s",s[i]);
  for(i=0;i<N;i++){
    m=strlen(s[i]);
    if(s[i][0]=='B'){
      b++;
      if(s[i][m-1]=='A')c++;
    }
    if(s[i][m-1]=='A')a++;
    for(j=0;j<9;j++){
      if(s[i][j]=='A'&&s[i][j+1]=='B')ans++;
    }
  }
  if(a<b)d=a;
  else d=b;
  if(a==b&&b==c&&c!=0)d--;
  ans += d;
  printf("%d\n",ans);
  return 0;
}
