#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <utility>
using namespace std;
#define fir first
#define sec second

#define lson(i) (tr[i].ls)
#define rson(i) (tr[i].rs)

#define FIO(file) freopen(file".in","r",stdin), freopen(file".out","w",stdout)

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef __int128_t i128;
typedef __uint128_t u128;
const int maxn=1005;
char s[maxn][20];
int n,len[maxn];
int rid[maxn][20],id;
vector< pair<int,int> > G[maxn*20];
int dis[maxn*20];
bool vis[maxn];
priority_queue< pair<int,int> > q;
int main()
{
   	scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
    	scanf("%s",s[i]+1);
    	len[i]=strlen(s[i]+1);
    }
    for(int i=1;i<=n;i++)
		for(int j=0;j<=len[i];j++)
			rid[i][j]=++id;
	//for(int i=1;i<=n;i++)cout<<len[i]<<' ';cout<<'\n';
	for(int i=1;i<=n;i++)
	{
		for(int j=len[i];j>=1;j--)
		{
			for(int k=1;k<=n;k++)
			if(j==len[i]&&k==i)continue;
			else 
			{
				int t=min(j,len[k]);
				bool flag=1;
				for(int z=1;z<=t;z++)
					if(s[i][len[i]-j+z]!=s[k][z]){flag=0;break;}
				if(!flag)continue;
				//cout<<"!"<<i<<' '<<j<<' '<<k<<'\n';
				if(j<len[k])G[rid[i][j]].push_back({rid[k][len[k]-j],t});
				else G[rid[i][j]].push_back({rid[i][j-len[k]],t});
			}
		}
	}
	memset(dis,0x3f,sizeof dis);
	for(int i=1;i<=n;i++)
		dis[rid[i][len[i]]]=0,q.push({0,rid[i][len[i]]});
	while(!q.empty())
	{
		int u=q.top().second;
		q.pop();
		if(vis[u])continue;
		vis[u]=1;
		for(auto [v,w]:G[u])
			if(dis[v]>dis[u]+w)
			{
				dis[v]=dis[u]+w;
				q.push({-dis[v],v});
			}
	}
	int ans=1e9;
	for(int i=1;i<=n;i++)
		ans=min(ans,dis[rid[i][0]]);
	if(ans>=1e9)puts("0");
	else cout<<ans<<'\n';
}