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
import java.io.InputStream;
import java.io.PrintStream;
import java.util.*;

public class Main {

  public static void main(String[] args) {
    solve(System.in, System.out);
  }

  static void solve(InputStream is, PrintStream os) {
    Scanner sc = new Scanner(is);

    /* read */
    int n = sc.nextInt();
    String[] s = new String[n];

    for (int i = 0; i < n; i++) {
      s[i] = sc.next();
    }

    int ans = 0;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j + 2 < s[i].length(); j++) {
        if(s[i].substring(j, j + 2).equals("AB")) ans++;
      }
    }

    int bxa = 0;
    int bxx = 0;
    int xxa = 0;
    for (int i = 0; i < n; i++) {
      char st = s[i].charAt(0);
      char en = s[i].charAt(s[i].length() - 1);
      if (st == 'B' && en == 'A') bxa++;
      else if (st == 'B') bxx++;
      else if (en == 'A') xxa++;
    }

    if (bxa > 0) {
      ans += bxa - 1;
      if (xxa > 0) {
        ans++; xxa--;
      }
      if (bxx > 0) {
        ans++; bxx--;
      }
    }
    ans += Math.min(xxa, bxx);
    os.println(ans);
  }
}
