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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Stack;

public class Main {
	
	public static void main(String[] args) throws NumberFormatException, IOException
	{
		new Main().run();
	}
	
	public void run() throws NumberFormatException, IOException
	{
		BufferedReader file = new BufferedReader(new InputStreamReader(System.in));
		int N = Integer.parseInt(file.readLine());
		char[][] strs = new char[N][];
		int b = 0;
		int ba = 0;
		int a = 0;
		int cnt = 0;
		for(int i = 0;i<N;i++)
		{
			strs[i] = file.readLine().trim().toCharArray();
			if(strs[i][0] == 'B'){
				if(strs[i][strs[i].length-1]=='A')
					ba++;
				else
					b++;
			}
			else if(strs[i][strs[i].length-1]=='A')
				a++;
			for(int j = 0;j<strs[i].length-1;j++)
			{
				if(strs[i][j]=='A' &&strs[i][j+1] == 'B')
					cnt++;
			}
		}
		if(a!=0)
		{
			a--;
			cnt+=ba;//now ends with a
			if(b!=0)
			{
				b--;
				cnt++;
			}
			cnt+=Math.min(a,b);
		}else if(ba!=0){
			cnt+=ba-1;
			if(b!=0)
				cnt++;
		}
		System.out.println(cnt);
	}
	
}
