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.*;

public class Main{
  public static void main(String... args) throws IOException {
    BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
    String line = stdin.readLine();
    String[] in = line.split(" ");
    int n = Integer.parseInt(in[0]);
    System.err.println(n);
    int beginB = 0;
    int endA = 0;
    int naka = 0;
    boolean sep = false;
	for (int i=0; i<n; i++) {
	  line = stdin.readLine();
      boolean begin = line.charAt(0) == 'B';
      if (begin) {
        beginB++;
      }
      boolean end = line.charAt(line.length() - 1) == 'A';
      if (end) {
        endA++;
      }
      if ((begin ^ end) && !sep) {
        sep = true;
      }
      naka += line.split("AB").length - 1;
    }
    System.err.println(beginB);
    System.err.println(endA);
    System.err.println(naka);
    System.err.println(sep);
	
    int ret;
    if (sep || beginB == 0) {
      ret = naka + Math.min(beginB, endA);
    } else {
      ret = naka + beginB - 1;
    }
    System.out.println(ret);
  }
}