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 x=0,y=0;
  int ans=0;
  int z=0;
  for(int i=0;i<N;++i){
    string st;cin>>st;
    for(int j=0;j<st.size()-1;++j){
      if(st[j]=='A'&&st[j+1]=='B')ans++;
    }
    int t=0,u=0;
    if(st[0]=='B')t=1;
    if(st.back()=='A')u=1;
    x+=t;
    y+=u;
    z+=(t|u);
    
  }
  if(x&&x==y&&x==z)ans--;
  ans+=min(x,y);
  cout<<ans<<endl;
  return 0;
}
