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 as=0,bs=0,abg=0,reg=0;
  for(int i=0;i<n;i++){
    string a;
    cin >> a;
    int q=a.size();
    for(int w=0;w<q-1;w++){if(a[w] == 'A' && a[w+1] == 'B'){reg++;}}
      if(a[0] == 'B' && a[q-1] == 'A'){abg++;
                                    continue;}
      if(a[q-1] == 'A'){as++;}
    if(a[0] == 'B'){bs++;}
  }
 if(abg == 0){cout << min(as,bs)+reg << endl;}
  else{if(as+bs>0){cout << abg + min(as,bs)+reg << endl;}else{cout << abg-1+reg << endl;}}
}
