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 <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

int main(){
  int n, ret=0;
  cin >> n;
  vector<string>s(n);
  for(int i=0; i<n; i++)cin >> s[i];
  int la=0, fb=0, lafb=0;
  for(int i=0; i<n; i++){
    for(int j=0; j<s[i].length()-1; j++){
      if(s[i][j]=='A' && s[i][j+1]=='B')ret++;
    }
    if(s[i][0]=='B')fb++;
    if(s[i][s[i].length()-1]=='A')la++;
    if(s[i][0]=='B' && s[i][s[i].length()-1]=='A')lafb++;
  }
  ret+=min(la, fb);
  if(lafb>0 && la+fb-2*lafb==0)ret--;
  cout << ret;
  return 0;
}