#include <iostream>
#include <algorithm>
using namespace std;
int main(){
  int n;
  cin >> n;
  string s[n];
  int ans = 0,a=0,b=0,w=0;
  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'){
        ans++;
      }
    }
    if(s[i][0]=='B'&&s[i][s[i].length()-1]=='A') w++;
    else if(s[i][0]=='B') b++;
    else if(s[i][s[i].length()-1]=='A') a++;
  }
  if(a+b!=0) cout << ans+min(a+w,b+w) << endl;
  else cout << max(ans,ans+w-1) << endl;
  return 0;
}

### Prompt

Please provide a cpp coded solution to the problem described below:

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];
  int ans = 0,a=0,b=0,w=0;
  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'){
        ans++;
      }
    }
    if(s[i][0]=='B'&&s[i][s[i].length()-1]=='A') w++;
    else if(s[i][0]=='B') b++;
    else if(s[i][s[i].length()-1]=='A') a++;
  }
  if(a+b!=0) cout << ans+min(a+w,b+w) << endl;
  else cout << max(ans,ans+w-1) << endl;
  return 0;
}

```