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.util.*;
public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int BA = 0;
    int XA = 0;
    int BX = 0;
    int ans = 0;
    for (int i = 0; i < N; i++) {
      String s = sc.next();
      char first = s.charAt(0);
      char last = s.charAt(s.length()-1);
      if (first == 'B' && last == 'A') {
        BA++;
      } else if (last == 'A') {
        XA++;
      } else if (first == 'B') {
        BX++;
      }
      for (int j = 0; j < s.length()-1; j++) {
        if (s.charAt(j) == 'A' && s.charAt(j+1) == 'B') {
          ans++;
        }
      }
    }
    //System.err.println(""+ans+" BA " +BA+ " XA " + XA+" BX " +BX);

    if (BA > 0) {
      ans += BA-1;
      if (BX > 0) {
        ans++;
        BX--;
      }
      if (XA > 0) {
        ans++;
        XA--;
      }
    }
    ans += Math.min(XA, BX);
    System.out.println(ans);
  }
}