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{
  static int[] ans;
  public static void main(String[]args){
    Scanner sc = new Scanner(System.in);
    int N = Integer.parseInt(sc.nextLine());
    int a = 0, b = 0, c = 0, ab = 0;
    for(int i = 0; i < N; i++){
      String S = sc.nextLine();
      int s = S.length();
      for(int j = 0; j < s-1; j++){
        if(S.charAt(j) == 'A' && S.charAt(j+1) == 'B'){
          ab++;
        }
      }
      if(S.charAt(0) == 'B' && S.charAt(s-1) == 'A'){
        c++;
      }else if(S.charAt(0) == 'B'){
        b++;
      }else if(S.charAt(s-1) == 'A'){
        a++;
      }
    }
    int min = Math.min(a, b);
    int D = 0;
    if(c == 0){
      D = min;
    }else{
      if(a + b == 0){
        D = c-1;
      }else{
        D = c + min;
      }
    }
    System.out.println(ab+D);
  }
}