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<iostream>
#include<string>
using namespace std;
int main(){
  long long  n,tmp,num,cnt=0,lb=0,ra=0,ab=0;
  string s;
  cin >> n;
  for(int i=0;i<n;i++){
    cin >> s;
    for(int i=0;i<s.size()-1;i++){
      if(s[i]=='A'&&s[i+1]=='B'){
        cnt++;
      }
    }
    if(s[0]=='B'&&s[s.size()-1]=='A') ab++;
      else if(s[0]=='B') lb++;
      else if(s[s.size()-1]=='A') ra++;
  }
  if(ab==0){
    cnt+=min(ra,lb);
  }else{
    if(ra+lb>0){
      cnt+=ab+min(ra,lb);
    }else{
      cnt+=ab-1;
    }
  }
  cout << cnt << endl;
}
