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<iostream>
#include<string>
using namespace std;
int main () {
  int N;
  cin >> N;
  int A = 0;
  int B = 0;
  int AB = 0;
  int ans = 0;
  for (int j = 0; j < N; j ++) {
    string S;
    cin >> S;
    if (S[0] == 'B') {
      if (S[S.size() - 1] == 'A') AB ++;
      else B ++;
    }
    else if (S[S.size() - 1] == 'A') A ++;
    for (int i = 0; i < S.size() - 1; i ++) {
      if (S[i] == 'A' && S[i + 1] == 'B') ans ++;
    }
  }
  int k = min(A, B) + AB;
  if (A + B == 0 && AB != 0) k --;
  ans += k;
  cout << ans << endl;
}

