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

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		int x = 0, y = 0, z = 0;

		int cnt = 0;
		for (int i = 0; i < N; i++) {
			String s = sc.next();

			//AB
			for (int j = 0; j < s.length() - 1; j++) {
				if(s.charAt(j) == 'A' && s.charAt(j + 1) == 'B') cnt++;
			}

			if(s.charAt(0) == 'B' && s.charAt(s.length() - 1) == 'A') x++;		//B---A
			else if(s.charAt(s.length() - 1) == 'A') y++;	//----A
			else if(s.charAt(0)== 'B') z++;		//B----

		}

		int ans = 0;
		if (x != 0) {
			if(y == 0 && z == 0)
				ans = x - 1;
			else
				ans = Math.min(y, z) + x;
		} else {
			ans = Math.min(y, z);
		}

		//System.out.println(cnt + " " + x + " " + y + " " + z);

		System.out.println(ans + cnt);
	}

}