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 a_c = 0;
    int b_c = 0;
    int ab_c = 0;
    int count = 0;
    for(int i = 0;i < N;i++){
      String str = sc.next();
      int len = str.length();
      if(str.charAt(0) == 'B' && str.charAt(len-1) == 'A')ab_c++;
      else if(str.charAt(0) == 'B')b_c++;
      else if(str.charAt(len-1) == 'A')a_c++;
      if(len == 2&&str.charAt(0) == 'A' && str.charAt(1) == 'B')count++;
      else for(int j = 0;j < len-2;j++)if(str.charAt(j) == 'A' && str.charAt(j+1) == 'B')count++;
    }
    int ans = count;
    if(a_c == 0 && b_c == 0 && ab_c < 2);
    else if(a_c == 0 && b_c == 0 && ab_c > 1)ans += ab_c-1;
    else{
      ans += ab_c-1;
      if(a_c > b_c){
        ans += b_c+1;
      }else{
        ans += a_c+1;
      }
    }
    System.out.println(ans);
  }
}