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 count1=0,count2=0;
  int kaage=1;
  for(int i=0;i<N;i++){
    string S;cin>>S;
    bool a=false,b=false;
    if(S.at(0)=='B'){a=true;count1++;}
    if(S.at(S.size()-1)=='A'){b=true;count2++;}
    if(!a&&!b)kaage++;
    for(int j=0;j<S.size()-1;j++){
      if(S.at(j)=='A'&&S.at(j+1)=='B')ans++;
    }
  }
  cout<<ans+min(min(count1,count2),max(0,N-kaage))<<endl;
}
