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.*;
import java.io.*;
public class Main{
    public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		PrintWriter ou = new PrintWriter(System.out);
		int n = Integer.parseInt(sc.next());
		int OO = 0 , OX = 0 , XO = 0;
		int yono = 0;
		for(int i = 0 ; i < n ; i++){
			String s = sc.next();
			if(s.charAt(0) == 'B' && s.charAt(s.length() - 1) == 'A') OO++;
			else if(s.charAt(0) == 'B') OX++;
			else if(s.charAt(s.length() - 1) == 'A') XO++;
			for(int ii = 0 ; ii < s.length() - 1 ; ii++){
				if(s.charAt(ii) == 'A' && s.charAt(ii + 1) == 'B') yono++;
			}
		}
		yono += OO + Math.min(OX , XO);
		if(OX == XO && OX == 0 && OO != 0) yono--;
		ou.print(yono + "\n");
		ou.flush();
    }
}