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, ans=0, endA=0, beginB=0, same=0; cin >> N;
  for (int i=0; i<N; i++) {
    string S; cin >> S;
    for (int j=0; j<=S.length()-2; j++) {
      if(S[j]=='A'&&S[j+1]=='B') ans++;
    }
    if(S[0]=='B') beginB++;
    if(S[S.length()-1]=='A') endA++;
    if(S[0]=='B'&&S[S.length()-1]=='A') same++;
  }
  if(endA==beginB&&endA==same&&endA!=0) ans += endA-1;
  else ans += min(endA, beginB);
  cout << ans << "\n";
}
      