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::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  int n, total, end, start, both,y;
  total = end = start = both = 0;
  cin >> n;
  for (int x = 0; x < n; x++) {
    string s;
    cin >> s;
    for (y = 0; y < s.length()-1; y++) if (s.substr(y,2) == "AB") total++;
    if (s[0] == 'B') {
      if (s[y] == 'A') {
        both++;
      }
      start++;
    }
    if (s[y] == 'A') end++;
  }
  if (start == both && end == both && both) total--;
  cout << total+min(end,start) << '\n';
  return 0;
}
