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
#include <iostream>
#include <string>
using namespace std;

typedef long long ll;

int main(){
	int n;
	int x=0,y=0,z=0;
	cin >> n;
	int cnt = 0;
	for(int i = 0 ; i < n ; i ++){
		string s;
		cin >> s;
		if(s[0] == 'B'){
			if(s[s.size()-1] == 'A')z ++;
			else x ++;
		}
		else if(s[s.size()-1] == 'A')y ++;
		for(int j = 0 ; j+1 < s.size() ; j ++){
			if(s[j] == 'A' && s[j+1] == 'B')cnt ++;
		}
	}
	if(x == 0){
		if(y > 0)cout << cnt+z << endl;
		else cout << cnt+max(0,z-1) << endl;
	}
	else if(y == 0){
		cout << cnt+z << endl;
	}
	else cout << cnt+min(x,y)+z << endl;
}
