#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;

const ll MOD = (ll)1e9 + 7;
const ll MOD2 = 998244353;
const ll LLINF = (ll)1e18;
const ll INTINF = (ll)1e9;
const long double PI = 3.1415926535897932384626433;

template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max<T>(a,b);}
template <class T> void chmin(T& a, const T b){a=min<T>(a,b);}
void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;}

int main() {
	int N; cin >> N;
	V<string> S(N);
	queue<string>A,B,BA,T;
	for(int i = 0; i < N; ++i) cin >> S[i];
	
	for(int i = 0; i < N; ++i){
		if(S[i].front()=='B' && S[i].back()=='A') BA.push(S[i]);
		else if (S[i].front()=='B') B.push(S[i]);
		else if (S[i].back()=='A') A.push(S[i]);
		else T.push(S[i]);
	}

	string sum = "";
	while(A.size() && BA.size() && B.size()){
		sum += A.front();
		A.pop();
		while(BA.size()){
			sum += BA.front();
			BA.pop();
		}
		sum += B.front();
		B.pop();
	}

	while(A.size() && BA.size()){
		sum += A.front();
		A.pop();
		while(BA.size()){
			sum += BA.front();
			BA.pop();
		}
	}
	while(B.size() && BA.size()){
		while(BA.size()){
			sum += BA.front();
			BA.pop();
		}
		sum += B.front();
		B.pop();
	}
	while(A.size() && B.size()){
		sum += A.front();
		sum += B.front();
		A.pop();
		B.pop();
	}
	while(A.size()){
	    sum += A.front();
		A.pop();
	}
	while(B.size()){
	    sum += B.front();
		B.pop();
	}
	while(BA.size()){
	    sum += BA.front();
		BA.pop();
	}
	while(T.size()){
	    sum += T.front();
		T.pop();
	}
	int ans = 0;
	for(int i = 0; i + 1 < sum.size(); ++i) if(sum[i] == 'A' && sum[i+1] == 'B') ans++; 
	cout << ans << endl;
	
	return 0;
}


Measured memory_bytes: 1536