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>
# define INF 1e9
using namespace std;

int main(){

  int N;
  cin >> N;
  int c1=0, c2=0, c3=0;
  int ans = 0;
  for(int i=0; i<N; i++){
    string s;
    cin >> s;
    int m = s.length();
    for(int i=0; i<m-1; i++){
      if(s.substr(i, 2) == "AB") ans++;
    }
    if(s[0] == 'B' && s[m-1] == 'A') c1++;
    else if (s[0] == 'B') c2++;
    else if (s[m-1] == 'A') c3++;
  }

  if(c1 == 0){
    ans += min(c2, c3);
  } else {
    ans += c1-1;
    if(c2 > 0 || c3 > 0){
      ans++;
      ans += min(c2, c3);
    }
  }
  cout << ans << endl;

}