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>
using namespace std;

int main(){

  int N, numB=0, numA=0, numC=0,ans=0;
  bool A=false;
  cin >> N;
  string s[N];
  for(int i=0; i<N; i++){
    cin >> s[i];
    if(s[i][0]=='B') numB++;
    if(s[i][s[i].size()-1]=='A') numA++;
    if(s[i][0]=='B' && s[i][s[i].size()-1]=='A') numC++;
  }

  ans = min(numA, numB);

  for(int i=0; i<N; i++){
    for(int j=1; j<s[i].size(); j++){
      if(s[i][j]=='B'&&s[i][j-1]=='A'){
         ans++;
      }
    }
  }

  if(numA==numB&&numA==numC&&numA!=0)ans--;

  cout << ans << endl;

  return 0;
}
