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 <cstdio>
#include <algorithm>

int main()
{
  int n;
  scanf("%d", &n);
  int count = 0;
  int ba = 0;
  int b_ = 0;
  int _a = 0;
  char s[11];
  for (int i = 0; i < n; ++i)
  {
    scanf("%s", s);
    int j;
    for (j = 0; s[j]; ++j)
    {
      if (s[j] == 'A' && s[j + 1] == 'B')
      {
        ++count;
      }
    }
    if (*s == 'B' && s[j - 1] == 'A') ++ba;
    else if (s[j - 1] == 'A') ++_a;
    else if (*s == 'B') ++b_;
  }
  printf("%d\n", count + (_a + b_ > 0 ? ba + std::min(_a, b_) : std::max(ba - 1, 0)));
  return 0;
}