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 rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;

int main(){
  int n;
  cin>>n;
  int ans=0,b_=0,_a=0,b_a=0;
  rep(i,n){
    string s;
    cin>> s;
    int m=s.size();
    if(s[0]=='B') b_++;
    if(s[m-1]=='A') _a++;
    if(s[0]=='B' and s[m-1]=='A') b_a++;
    rep(j,m-1){
      if(s[j]=='A' and s[j+1]=='B') ans++;
    }
  }
  ans+= min(b_,_a);
  if(_a==b_ and b_==b_a and b_a!=0 ) ans--;
  cout << ans;
}