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,c = 0,a = 0,b = 0,ba = 0,i;string s;cin >> n;
  while(cin >> s){
    for(i=0;i<s.size()-1;i++){
      if(s.substr(i,2) == "AB") c++;
    }
    if(s[0]=='B' && s[s.size()-1]=='A') ba++;
    else if(s[s.size()-1]=='A') a++;
    else if(s[0]=='B') b++;
  }
  if(ba>0) c += ba-1;
  if(ba>0 && a>0){
    c++;a--;
  }
  if(ba>0 && b>0){
    c++;b--;
  }
  c += min(a,b);
  cout << c << "\n";
}