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 BA = 0, Bx = 0, xA = 0, AB = 0;
  for (int i = 0; i < N; i++) {
    string s; cin >> s;
    if (s.at(0) == 'B' && s.back() == 'A') BA++;
    else if (s.at(0) == 'B') Bx++;
    else if (s.back() == 'A') xA++;
    for (int j = 1; j < s.size(); j++) {
      if (s.at(j-1) == 'A' && s.at(j) == 'B') AB++;
    }
  }
  if (BA == 0) cout << AB + min(Bx, xA) << endl;
  else if (Bx == 0 && xA == 0) cout << AB + BA - 1 << endl;
  else cout << AB + BA + min(Bx, xA) << endl;
}