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;
int main()
{
 int i,j,ans,n,size,bicho,flag;
 string s;
  int a,b,c,d;
  c=0;d=0;
  a=0;b=0;bicho=0;
  cin >> n;
  for(i=0;i<n;i++)
  {
   cin >> s;
    size=s.size();
    if(s.at(0)=='B')
      b++;
    if(s.at(size-1)=='A')
      a++;
    if(s.at(0)=='B'&&s.at(size-1)=='A')
      d++;
    
    for(j=0;j<size-1;j++)
    {
     if(s.at(j)=='A'&&s.at(j+1)=='B')
       c++;
    }
    
     
    
  }

  
  if(b>=a)
    ans=a;
  if(a>b)
    ans=b;
  if(a==b&&b==d&&d>0)
    ans=ans-1;

  cout << ans+c << endl;
  
  
}