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 <vector>

using namespace std;

int main() {
  int N, ans{}, bh{}, at{}, ba{};
  cin >> N;
  vector<string> s(N);
  for (auto &x : s) {
    cin >> x;
    if (x[0] == 'B')
      if (x.back() == 'A') ++ba;
      else ++bh;
    else if (x.back() == 'A') ++at;
    for (int i = 0, n = x.size(); i < n - 1; ++i)
      if (x[i] == 'A' && x[i + 1] == 'B') ++ans, ++i;
  }

  ans += ba;
  if (bh + at) {
    ans += min(bh, at);
  } else if (ba) {
    --ans;
  }
  cout << ans << endl;
}
