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 n;
  scanf("%d",&n);
  int A = 0 , B = 0 , All = 0 , AB = 0;
  for(int i = 0 ; i < n ; i++)
  {
    string te; cin>>te;
    if(te[0] == 'B' && te[te.size()-1] == 'A') AB++;
    else if(te[0] == 'B') B++;
    else if(te[te.size()-1] == 'A') A++;
    for(int j = 1 ; j < te.size() ; j++)
    {
      if(te[j-1] == 'A' && te[j] == 'B') All++;
    }
  }
  if(AB)
  {
    All += AB-1;
    if(A) All++, A--;
    if(B) All++, B--; 
  }
  //cout<<All <<"  " << A << B<<endl;
  cout<<min(A,B) + All<<endl;
}