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 ans = 0;
		int enda = 0, startb = 0, startbenda = 0;
		for(int i = 0; i < N; i++) {
			char[] s = sc.next().toCharArray();
			for(int j = 0; j < s.length-1; j++) {
				if(s[j] == 'A' && s[j+1] == 'B')
					ans++;
			}
			if(s[0] == 'B' && s[s.length-1] == 'A')
				startbenda++;
			if(s[0] == 'B')
				startb++;
			if(s[s.length-1] == 'A')
				enda++;			
		}
		ans += Math.min(enda, startb);
		if(enda == startbenda && startb == startbenda && startbenda != 0)
			ans--;
		System.out.println(ans);

	}

}