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() {
  std::ios_base::sync_with_stdio(false);
  int n;
  cin >> n;
  int c1 = 0, c2 = 0, c3 = 0, ans = 0;
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    for (int j = 0; j + 1 < s.size(); j++) {
      if (s[j] == 'A' && s[j + 1] == 'B') ans++;
    }
    if (s[0] == 'B' && s[s.size() - 1] == 'A') c1++;
    if (s[0] == 'B') c2++;
    if (s[s.size() - 1] == 'A') c3++;
  }
  ans += min(c2, c3);
  if (c2 == c3 && c1 == c3 && c1) ans--;
  cout << ans << endl;
  return 0;
}
