#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int n;
char s[111];

int main() {
	scanf("%d", &n);
	
	int first_b = 0, end_a = 0, ans=0, f = 1;
	for(int i=0;i<n;i++) {
		scanf("%s", s);
		int l = strlen(s);
		
		int x = 0;
		if(s[0]=='B') { first_b ++; x ++; }
		if(s[l-1] == 'A') { end_a ++; x ++; }
		if(x==1) f = false;
		
		for(int j=1;j<l;j++)
			if(s[j-1]=='A' && s[j]=='B') ans++;
	}
	ans += max(0, min(first_b, end_a)-f);
	printf("%d\n", ans);
	
	return 0;
}