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 <algorithm>
#include <vector>
#include <cmath>
#include <map>
using namespace std;

int main(){
	int N;
	cin >> N;
	string S[N];
	for(int i=0;i<N;i++){
		cin >> S[i];
	}
	int ans = 0, A = 0, B=0,AB = 0;
	for(int i=0;i<N;i++){
		for(int j=0;j+1<(int)S[i].size();j++){
			if(S[i][j] == 'A' && S[i][j+1] == 'B')ans++;
		}
		if(S[i][0] == 'B')B++;
		if(S[i][(int)S[i].size()-1] == 'A')A++;
		if(S[i][0] == 'B' && S[i][(int)S[i].size()-1] == 'A')AB++;
	}
	ans += min(A,B);
	if(A == AB && B == AB && AB)ans--;
	cout << ans << endl;
}