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>
#include<vector>
using namespace std;
#define rep(i, n)        for(int i=0; i<(int)(n); ++i)
int main() {
  int a,c=0,d=0,e=0,f=0,g=0;cin>>a;
  string b;
  rep(i,a){
    cin>>b;
     if(b.at(b.size()-1)=='A'&&b.at(0)=='B')e++;
    else if(b.at(0)=='B')f++;
    else if(b.at(b.size()-1)=='A')g++;
    for(int o=0;o<b.size()-1;o++){
      if(b.at(o)=='A'&&b.at(o+1)=='B')c++;
    }
  }
  if(e>=1&&f==0&&g==0)c--;
  cout<<c+min(e+g,f+e);
}