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>
#define int long long
using namespace std;
signed main(){
  int N,ans=0,A=0,B=0,C=0;
  cin>>N;
  for(int k=0;k<N;k++){
    string S;
    cin>>S;
    int a=0,b=0;
    for(int i=0;i<S.size()-1;i++)
      if(S.substr(i,2)=="AB")
        ans++;
    if(S[0]=='B' && S[S.size()-1]=='A')
      C++;
    if(S[0]=='B')
      B++;
    if(S[S.size()-1]=='A')
      A++;
  }
  if(A==C && B==C && C>0)
    cout<<ans+C-1<<endl;
  else
    cout<<ans+min(A,B)<<endl;
}