#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <cstdio>
#include <climits>
#include <complex>
#include <cstdint>
#include <tuple>

#define M_PI       3.14159265358979323846

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
struct Edge {
    int to, cost;
    Edge(int to, int cost): to(to), cost(cost) {}
};

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<Edge>> AdjList;
AdjList graph;
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
const int INF = 100000000;

int GCD(int a, int b){
    if(a < b) swap(a, b);
    if(b == 0) return a;
    return GCD(b, a%b);
}

struct dat{
    int to, cost;
    dat(int a, int b){
        to = a;
        cost = b;
    }
};
bool cmp(const pii& a, const pii& b){
    if(a.first == b.first){
        return a.second < b.second;
    }
    return a.first < b.first;
}

vector<string> v;
int main() {
    //cout << fixed << setprecision(15);

    int N; cin >> N;

    int t = 0;

    int a=0, b=0, c=0;
    for(int i=0; i<N; ++i){
        string s; cin >> s;
        int n = s.size();
        if(s[0] == 'B' && s[n-1] == 'A'){
            for(int j=1; j<n-2; ++j){
                if(s[j]=='A' && s[j+1] == 'B') t++;
            }
            a++;
        }else if(s[0]=='B'){
            for(int j=1; j<n-1; ++j){
                if(s[j]=='A' && s[j+1] == 'B') t++;
            }
            b++;
        }else if(s[n-1]=='A'){
            for(int j=0; j<n-2; ++j){
                if(s[j]=='A' && s[j+1] == 'B') t++;
            }
            c++;
        }else{
            for(int j=0; j<n-1; ++j){
                if(s[j]=='A' && s[j+1] == 'B') t++;
            }
        }
    }

    int ans = t;
    if(a==0){
        cout << ans + min(b, c) << endl;
    }else{
        if(b+c>0){
            cout << ans + a + min(b, c) << endl;
        }else if(b+c==0){
            cout << ans + a-1 << endl;
        }
    }
    return 0;
}

Measured memory_bytes: 256