#include <iostream>
#include <algorithm>
using namespace std;

int main(){
  int n;
  cin >> n;
  string s[n];
  for(int i=0;i<n;i++){
    cin >> s[i];
  }
  int a=0,b=0,count=0,t=0;
  for(int i=0;i<n;i++){
    int k=s[i].size();
    if(s[i].at(0)=='B') b++;
    if(s[i].at(k-1)=='A') a++;
    if(s[i].at(0)=='B'&&s[i].at(k-1)=='A') t++;
    for(int j=0;j<k-1;j++){
      if(s[i].at(j)=='A'&&s[i].at(j+1)=='B'){
        count++;
      }
    }
  }
  if(t==a&&t==b&&t!=0) count--;
  cout << count+min(a,b) << endl;
}

### Prompt

In CPP, your task is to solve 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 <iostream>
#include <algorithm>
using namespace std;

int main(){
  int n;
  cin >> n;
  string s[n];
  for(int i=0;i<n;i++){
    cin >> s[i];
  }
  int a=0,b=0,count=0,t=0;
  for(int i=0;i<n;i++){
    int k=s[i].size();
    if(s[i].at(0)=='B') b++;
    if(s[i].at(k-1)=='A') a++;
    if(s[i].at(0)=='B'&&s[i].at(k-1)=='A') t++;
    for(int j=0;j<k-1;j++){
      if(s[i].at(j)=='A'&&s[i].at(j+1)=='B'){
        count++;
      }
    }
  }
  if(t==a&&t==b&&t!=0) count--;
  cout << count+min(a,b) << endl;
}

```