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 <algorithm>
using namespace std;

int countAB(string S){
  int c=0;
  for(int i=0; i<S.size()-1; i++){
    if('A'==S[i] && 'B'==S[i+1]){c++;}
  }
  return c;
}

int main(){
  int N; cin >> N;
  string s; int a,b,c,sum; a=b=c=sum=0;
  for(int i=0; i<N; i++){
    cin >> s; sum = sum + countAB(s);
    if('A'==s[s.size()-1] && 'B'==s[0]){c++;}
    else if('A'==s[s.size()-1]){a++;}
    else if('B'==s[0]){b++;}
  }
  
  if(c==0){cout << sum + min(a,b);}
  else{cout << sum + c-1 + min(a,1) + min(b,1) + min(a-min(a,1),b-min(b,1));}
  
  return 0;
}