#include <bits/stdc++.h>
using namespace std ;

int main(){
  int n, x=0, a=0, b=0, c=0, ans;
  string s[20000];
  cin >> n;
  for(int i=0;i<n;i++){
    cin >> s[i];
    for(int j=0;j<s[i].length()-1;j++){
      if(s[i][j]=='A'&&s[i][j+1]=='B')x++;
    }
    int m=s[i].length();
    if(s[i][0]=='B'&&s[i][m-1]=='A')a++;
    else if(s[i][0]=='B')b++;
    else if(s[i][m-1]=='A')c++;
  }
  if(a==0)ans=min(b,c);
  else{
    if(b+c>0)ans=a+min(b,c);
    else ans=a-1;
  }
  cout << ans+x << endl;
  return 0;
}

### Prompt

Please create a solution in CPP 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(){
  int n, x=0, a=0, b=0, c=0, ans;
  string s[20000];
  cin >> n;
  for(int i=0;i<n;i++){
    cin >> s[i];
    for(int j=0;j<s[i].length()-1;j++){
      if(s[i][j]=='A'&&s[i][j+1]=='B')x++;
    }
    int m=s[i].length();
    if(s[i][0]=='B'&&s[i][m-1]=='A')a++;
    else if(s[i][0]=='B')b++;
    else if(s[i][m-1]=='A')c++;
  }
  if(a==0)ans=min(b,c);
  else{
    if(b+c>0)ans=a+min(b,c);
    else ans=a-1;
  }
  cout << ans+x << endl;
  return 0;
}

```