Domino

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF int(1e9+1)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define F(n) FOR(i,0,n)
#define FF(n) FOR(j,0,n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX 101
char s[MX];
int I[2][2][MX],L[2][2],N,l,a,b;
unordered_map<int,int> dp[2];
int HH(int L[2][2]){
    int H=0;
    F(2)FF(2)H*=100,H+=L[i][j];
    return H;
}
int dyn(int L[2][2],bool x){
    int H=HH(L);
    if(dp[x].count(H))return dp[x][H];
    int v=0;
    F(2)if(L[x][i]){
        --L[x][i];
        v=max(v,dyn(L,i)+I[x][i][L[x][i]]);
        ++L[x][i];
    }
    return dp[x][H]=v;
}
int main(void){
    scanf("%d",&N);
    F(N)scanf("%s",s),l=strlen(s),a=*s==66,b=s[l-1]==66,I[a][b][L[a][b]++]=l;
    F(2)FF(2)sort(I[i][j],I[i][j]+L[i][j]);
    printf("%d\n",max(dyn(L,0),dyn(L,1)));
    return 0;
}