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>
using namespace std;
int main(){
  int N;
  cin>>N;
  string s[10000];
  int a,b,c;
  a=0;
  b=0;
  c=0;
  long long answer=0;
  for(int i=0;i<N;i++){
    cin>>s[i];
    for(int j=0;j<s[i].size()-1;j++){
      if(s[i][j]=='A'&&s[i][j+1]=='B') answer++;
    }
    if(s[i][0]=='B') b++;
    if(s[i][s[i].size()-1]=='A') a++;
    if(s[i][0]=='B'&&s[i][s[i].size()-1]=='A') c++;
  }
  answer+=min(a,b);
  if(a==b&&b==c&&a!=0) answer--;
  cout<<answer<<endl;
  
  return 0;
}