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() {
  int N;
  cin >> N;
  int cnt = 0, a = 0, b = 0, ba = 0;
  for (int i = 0; i < N; i++) {
    string S;
    cin >> S;
    for (int j = 0; j + 1 < S.size(); j++) {
      if (S.at(j) == 'A' && S.at(j + 1) == 'B') cnt++;
    }
    if (S.front() == 'B' && S.back() == 'A') ba++;
    else if (S.front() == 'B') b++;
    else if (S.back() == 'A') a++;
  }
  
  if (a == 0 && b == 0) cnt += max(0, ba - 1);
  else cnt += ba + min(a, b);
  cout << cnt << "\n";
}