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;
using lint = long long;

signed main(){
  lint N; cin >> N;
  lint ans = 0, ca = 0, cb = 0, cab = 0;
  for(lint i = 0; i < N; i++){
    string s; cin >> s;
    for(lint i = 1; i < s.size(); i++){
      if(s[i - 1] == 'A' && s[i] == 'B') ans++;
    }
    if(s[0] == 'B') cb++;
    if(s[s.size() - 1] == 'A') ca++;
    if(s[0] == 'B' && s[s.size() - 1] == 'A') cab++;
  }
  if(cab == ca && cab == cb && cab != 0) ans--;
  ans += min(ca, cb);
  cout << ans << endl;
}
