#include<bits/stdc++.h>
#include<iostream>
#include<cmath>
#include<vector>
#include<string>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<functional>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<vector<int> > mati;
typedef vector<vector<double> > matd;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cout << VEC[i] << " ";
  }
  cout << "\n";
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i, MAT.size()){
    REP(j, MAT[i].size()){
      cout << MAT[i][j] << " ";
    }
    cout << "\n";
  }
};

template <typename CLASS1, typename CLASS2>
class HOGE{
  public:
    CLASS1 key;
    CLASS2 value;
    HOGE(void){
      return;
    };
    HOGE(CLASS1 key, CLASS2 value){
      this->key = key;
      this->value = value;
    };
    ~HOGE(void){
      return;
    };

    void print(void){
      cout << "key : " << key << ", value : " << value << "\n";
      return;
    };
    
    bool operator==(const HOGE &obj){
      return (this->value == obj.value);
    };
    bool operator<(const HOGE &obj){
      return (this->value < obj.value);
    };
    bool operator>(const HOGE &obj){
      return (this->value > obj.value);
    };
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

class Union_Find{
  private:
    vll par;// parent
    vll rank;// depth

  public:
    Union_Find(ll N){
      par.resize(N);
      rank.resize(N);
      for(ll i=0; i<N; ++i){
        par[i] = i;
        rank[i] = 0;
      }
      return;
    };

    ~Union_Find(void){
      return;
    };

    //search the root
    ll find(ll x){
      if(par[x] == x){
        return x;
      }else{
        return par[x] = find(par[x]);
      }
    };

    //merge the sets x or y belong
    void unite(ll x, ll y){
      x = find(x);
      y = find(y);
      if(x == y) return;

      if(rank[x] < rank[y]){
        par[x] = y;
      }else{
        par[y] = x;
        if(rank[x] == rank[y]){
          rank[x]++;
        }
      }
      return;
    };

    //judge x and y belong the same set or not
    bool same(ll x, ll y){
      return find(x) == find(y);
    };
};

int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  ll N;
  cin >> N;
  vector<string> S(N);
  vector<ll> A_end;
  vector<ll> B_begin;
  vector<bool> AB_both(N, false);
  ll ans = 0;
  REP(i, N){
    cin >> S[i];
    REP(j, S[i].size()-1){
      if(S[i][j]=='A' && S[i][j+1]=='B') ans++;
    }
    if(S[i][0]=='B') B_begin.push_back(i);
    if(S[i][S[i].size()-1]=='A') A_end.push_back(i);
    if(S[i][0]=='B' && S[i][S[i].size()-1]=='A') AB_both[i] = true;
  }

  /*
  printf("%d\n", ans);
  vec_print(A_end);
  vec_print(B_begin);
  */

  Union_Find que(N);
  REP(i, A_end.size()){
    bool connect_flag = false;
    REP(j, B_begin.size()){
      if(!AB_both[B_begin[j]]) continue;
      if(A_end[i]!=B_begin[j] && !que.same(A_end[i], B_begin[j])){
        que.unite(A_end[i], B_begin[j]);
        B_begin.erase(B_begin.begin()+j);
        ans++;
        connect_flag = true;
        break;
      }
    }
    if(connect_flag) continue;
    REP(j, B_begin.size()){
      if(A_end[i]!=B_begin[j] && !que.same(A_end[i], B_begin[j])){
        que.unite(A_end[i], B_begin[j]);
        B_begin.erase(B_begin.begin()+j);
        ans++;
        break;
      }
    }
  }

  cout << ans << "\n";

  return 0;
}

Measured memory_bytes: 1152