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 <bits/stdc++.h>

using namespace std;

typedef long long LL;
#define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; ++i)
#define repm(i,a,b) for(int i = (int)(a) ; i > (int)(b) ; --i)

int main(){
	int N; cin >> N;
	vector<int> z(4,0);
	int ans = 0;
	repp(i,0,N){
		string S; cin >> S;
		int a = 0;
		for(auto c : S){
			if(c == 'B' && a == 1) ++ans;
			if(c == 'A') a = 1;
			else a = 0;
		}
		++z[(S[0]=='B'?2:0)+a];
	}
	ans += min(z[1],z[2])+max(0,z[3]-1);
	if((z[1] > 0 || z[2] > 0) && z[3] > 0) ++ans;
	cout << ans << endl;
	return 0;
}
