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;
#define MOD 1000000007

int main() {
  
  int N;
  cin >> N;

  int ans = 0,a = 0,b = 0,both = 0;
  for(int i = 0;i < N;i++) {
    string S;
    cin >> S;
    for(int j = 0;j < S.size()-1;j++) {
      if(S.at(j) == 'A' && S.at(j+1) == 'B') ans++;
    }
    if(S.at(0) == 'B' && S.at(S.size()-1) == 'A') {
      both++;
      continue;
    }
    if(S.at(0) == 'B') b++;
    if(S.at(S.size()-1) == 'A') a++;
   
  }

  if(both != 0 && a == 0 && b == 0) ans += both-1;
  else ans += both + min(a,b);
  cout << ans << endl;
}

