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;
  cin >> n;
  int cntb = 0, cnta = 0, both = 0, ab = 0;
  for(int i = 0; i < n; i++){
    string s;
    cin >> s;
    int l = s.size();
    for(int j = 0; j < l-1; j++){
      if(s.at(j) == 'A' && s.at(j+1) == 'B') ab++;
    }
    if(s.at(0) == 'B'){
      if(s.at(l-1) == 'A') both++;
      else cntb++;
    }
    else if(s.at(l-1) == 'A') cnta++;
  }
  
  if(both == 0) ab += min(cnta, cntb);
  else if(cnta + cntb == 0) ab += both - 1;
  else ab += min(cnta, cntb) + both;
  cout << ab << endl;
}