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() {
  long n,ans=0,fb=0,ea=0,fbea=0;
  cin >> n;
  vector<string> s(n);
  for(long i=0;i<n;i++) cin >> s[i];
  for(long i=0;i<n;i++) for(long j=0;j<s[i].size()-1;j++) if(s[i][j]=='A'&&s[i][j+1]=='B') ans++;
  for(long i=0;i<n;i++) {
    if(s[i][0]=='B') {
      if(s[i].back()=='A') {
        fbea++;
      } else {
        fb++;
      }
    } else if(s[i].back()=='A') {
      ea++;
    }
  }
  if(fbea>=2)ans+=fbea-1;
  if((fb>0||ea>0)&&fbea>=1) ans++;
  ans+=min(fb,ea);
  cout << ans << endl;
}