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 rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;

int main(){
  int N;
  cin >> N;
  int ans=0;
  int A=0,B=0,BA=0;
  rep(i,N) {
    string s;
    cin >> s;
    rep(j,s.size()-1) if(s[j]=='A' and s[j+1]=='B') ans++;
    if (s[0]=='B') B++;
    if (s.back()=='A') A++;
    if (s[0]=='B' and s.back()=='A') BA++;
  }
  if(B==BA and A==BA) A--;
  cout << ans+max(0,min(A,B)) << endl;
  return 0;
}
