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>
#define MAXN 3000
using namespace std;

int N, ans, a, b, k, m;
string s;

int main() {
  cin >> N;
  for (int i = 0; i < N; i++) {
    cin >> s;
    for (int j = 1; j < s.length(); j++) {
      if (s[j] == 'B' && s[j-1] == 'A') ans++;
    }
    if (s[0] == 'B') a--, k++;
    if (s[s.length()-1] == 'A') a++;
    if (s[0] == 'B' && s[s.length()-1] == 'A') m++;
  }
  if (a < 0) k += a;
  if (k == N || (m == k && !a)) k--;
  ans += max(0, k);
  cout << ans << endl;
}