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.FileNotFoundException;
import java.io.FileReader;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {

  public static void main(String[] args) throws FileNotFoundException {

//    Scanner cin = new Scanner(new FileReader("input.txt"));
    Scanner cin = new Scanner(System.in);

    int n = cin.nextInt();

    int res = 0;
    int concateA = 0;
    int concateB = 0;
    int concateAB = 0;
    for (int i=0;i<n;i++) {
      String line = cin.next();

      int fromIndex = 0;

      while ((fromIndex = line.indexOf("AB", fromIndex)) != -1 ){
//        System.out.println("Found at index: " + fromIndex);
        res++;
        fromIndex++;
      }

      if (line.lastIndexOf('A') == line.length()-1 && line.indexOf('B') != 0)
        concateA++;
      if (line.indexOf('B') == 0 && line.lastIndexOf('A') != line.length()-1)
        concateB++;
      if (line.lastIndexOf('A') == line.length()-1 && line.indexOf('B') == 0)
        concateAB++;
    }
//    System.out.println("A "+concateA+" B "+concateB+" BA "+concateAB);
//    if (concateA==n&&concateB==n) {
//      System.out.println(res+n-1);
//    }
//    else {
//      res = res + Math.min(concateA, concateB);
//      System.out.println(res);
//    }
    res = res + Math.min(concateA, concateB) + concateAB;
    if (concateA==0&&concateB==0&&concateAB!=0){
      System.out.println(res-1);
    }
    else
      System.out.println(res);

  }

}