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 n;

int main(void){
  cin >> n;
  int a=0, b=0, c=0, d=0;
  for(int i = 0; i < n; i++){
    string s;
    cin >> s;
    if(s[0] == 'B' && s[s.size()-1] == 'A') d++;
    else if(s[0] == 'B') b++;
    else if(s[s.size()-1] == 'A') a++;
    for(int j = 0; j < s.size()-1; j++){
      if(s.substr(j, 2) == "AB") c++;
    }
  }
  if(d == 0) c+=min(a, b);
  else{
    if(a+b == 0) c+=d-1;
    else c+=d+min(a, b);
  }
  cout << c << endl;

  return 0;
}
