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>
using namespace std;

int main()
{
  int n;
  cin >> n;
  int ans(0);
  int xa(0), ba(0), bx(0);

  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    auto pos = s.find("AB");
    while (pos != string::npos) {
      ans++;
      pos = s.find("AB", pos + 2);
    }
    int m(0);
    if (s.front() == 'B') m += 1;
    if (s.back() == 'A') m += 2;
    switch (m) {
    case 1: bx++; break;
    case 2: xa++; break;
    case 3: ba++; break;
    }
  }
  ans += ba == 0 ? min(xa, bx) : xa + bx == 0 ? ba - 1 : ba + min(xa, bx);
  cout << ans << endl;
}
