#include<bits/stdc++.h>
using namespace std;
int main(){
  #define int long
  int n,a,b,ba,res=0;
  cin>>n;
  string s;
  a=b=ba=0;
  for(int i=0;i<n;++i){
    cin>>s;
    int l=s.length();
    for(int j=0;j<l-1;++j)if(s[j]=='A'&&s[j+1]=='B')res++;
    if(s[0]=='B'&&s[l-1]=='A')ba++;
    else if(s[l-1]=='A')a++;
    else if(s[0]=='B')b++;
  }
  res+=max(ba-1,0L);
  if(a&&ba){
    a--;
    res++;
  }
  if(ba&&b){
    b--;
    res++;
  }
  cout<<res+min(a,b)<<endl;
  return 0;
}

### Prompt

Please formulate a cpp solution to the following problem:

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

### Response

```cpp
#include<bits/stdc++.h>
using namespace std;
int main(){
  #define int long
  int n,a,b,ba,res=0;
  cin>>n;
  string s;
  a=b=ba=0;
  for(int i=0;i<n;++i){
    cin>>s;
    int l=s.length();
    for(int j=0;j<l-1;++j)if(s[j]=='A'&&s[j+1]=='B')res++;
    if(s[0]=='B'&&s[l-1]=='A')ba++;
    else if(s[l-1]=='A')a++;
    else if(s[0]=='B')b++;
  }
  res+=max(ba-1,0L);
  if(a&&ba){
    a--;
    res++;
  }
  if(ba&&b){
    b--;
    res++;
  }
  cout<<res+min(a,b)<<endl;
  return 0;
}

```