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 r = 0, xa = 0, bx = 0, ba = 0;
  for (; n > 0; n--) {
    string s;
    cin >> s;
    for (int i = 0; i + 1 < s.size(); i++) {
      r += s[i] == 'A' && s[i + 1] == 'B';
    }
    xa += s.back() == 'A';
    bx += s.front() == 'B';
    ba += s.back() == 'A' && s.front() == 'B';
  }
  cout << r + min(xa, bx) - (ba && xa == ba && bx == ba) << endl;
}
