#include<bits/stdc++.h>
using namespace std;

int N,dp[1<<16][52];
string S[16];


int main(){
    cin>>N;
    for(int i=0; i<N; i++)cin>>S[i];
    for(int i=0; i<(1<<N); i++)for(int j=0; j<52; j++)
    {
        for(int k=0; k<N; k++)if(i&(1<<k))
        {
            if(j<26)
            {
                if(S[k][0]==('a'+j)){
                    int c;
                    if('a'<=S[k].back()&&S[k].back()<='z')c=S[k].back()-'a';
                    else c=S[k].back()-'A'+26;
                    dp[i][j]=max(dp[i][j],dp[i-(1<<k)][c]+(int)S[k].size());
                }
            }
            else
            {
                if(S[k][0]==('A'+j-26)){
                    int c;
                    if('a'<=S[k].back()&&S[k].back()<='z')c=S[k].back()-'a';
                    else c=S[k].back()-'A'+26;
                    dp[i][j]=max(dp[i][j],dp[i-(1<<k)][c]+(int)S[k].size());
                }
            }
        }
    }
    int ans=0;
    for(int i=0; i<N; i++)
    {
        int c;
        if('a'<=S[i].back()&&S[i].back()<='z')c=S[i].back()-'a';
        else c=S[i].back()-'A'+26;
        ans=max(ans,dp[(1<<N)-1][c]);
    }
    cout << ans << endl;
}