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 ans=0;
  int ca=0;
  int cb=0;
  int cba=0;
  for(int i=0;i<N;i++){
    string s;
    cin >> s;
    for(int j=0;j<s.size()-1;j++){
      if(s.substr(j,2)=="AB"){
        ans++;
      }
    }
    if((s.front()=='B')&&(s.back()=='A')){
      cba++;
    }else if(s.front()=='B'){
      cb++;
    }else if(s.back()=='A'){
      ca++;
    }
  }
  ans+=min(ca,cb);
  if(max(ca,cb)>0){
    ans+=cba;
  }else{
    ans+=max(0,(cba-1));
  }
  cout << ans << endl;
  return 0;
}
