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;
#define Rep(i, n) for(int i = 0; i < (int)(n); i++)

int main() {
int x,y,z,n,p,ans;
x = y = z = p =  0;
cin >> n;
string s;
  Rep(i,n){
    cin >> s;
    Rep(j,s.length()-1)
    {
      if(s.at(j)=='A' && s.at(j+1)=='B')
      {
        p++;
      }
    }


    if(s.at(0)=='B')
    {
      if(s.at(s.length()-1) == 'A')
      z++;
      else
      x++;
    }
    else if(s.at(s.length()-1) == 'A')
    y++;

  }
if( x== 0 && y== 0 && z > 0)
ans = z-1+p;
else
ans = p + z + min(x,y);
  cout << ans << endl;
}