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() {
  ios_base::sync_with_stdio(false); cin.tie(0);
  int ans = 0;
  int cnt[4] = {0};
  int n; cin >> n;
  for (int i = 0; i < n; ++i) {
    string s;
    cin >> s;
    for (int i = 0; i < s.size() - 1; ++i) {
      ans += s[i] == 'A' and s[i + 1] == 'B';
    }
    int hs = 0;
    hs += (s.back() == 'A') * 1;
    hs += (s[0] == 'B') * 2;
    ++cnt[hs];
  }
  if (cnt[1] or cnt[2]) {
    ans += cnt[3], cnt[3] = 0;
    ans += min(cnt[1], cnt[2]);
  }
  else ans += max(0, cnt[3] - 1);
  cout << ans << '\n';

}
