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 Bstart = 0, Aend = 0, BandA = 0;
  int ans = 0;
  for(int i=0; i<n; ++i){
    string s;
    cin >> s;
    if(s[0] == 'B' && s[s.size()-1] == 'A') ++BandA;
    else if(s[0] == 'B') ++Bstart;
    else if(s[s.size()-1] == 'A') ++Aend;
    
    for(int i=0; i<s.size()-1; ++i){
      if(s[i] == 'A' && s[i+1] == 'B') ++ans;
    }
  }
  ans += min(Aend + BandA, BandA + Bstart);
  if(Aend == 0 && Bstart == 0 && BandA != 0) --ans;
  cout << ans << endl;
}