#include<bits/stdc++.h>
using namespace std;
const int N=1e3+5,INF=1e9,M=16e6+5;
int n,len[N],a[N],cnt,dis[M],id[N][15],ed;
char s[20];
struct node{
    int i,j,val;
    bool operator< (const node &other)const{
        return val>other.val;
    }
};
priority_queue<node> q;
bool vis[M];
int main(){
    scanf("%d",&n),ed=cnt=1;
    for(int i=1;i<=n;++i){
        scanf("%s",s+1),len[i]=strlen(s+1);
        for(int j=0;j<len[i];++j) id[i][j]=++cnt;
        id[i][len[i]]=ed;
        for(int j=1;j<=len[i];++j) a[i]=a[i]<<1|(s[j]-'0');
    }
    for(int i=1;i<=cnt;++i) dis[i]=INF;
    for(int i=1;i<=n;++i) q.push({i,0,dis[id[i][0]]=len[i]});
    while(!q.empty()){
        int i=q.top().i,j=q.top().j,x=id[i][j]; q.pop();
        if(vis[x]) continue; vis[x]=true;
        for(int k=1;k<=n;++k) if((i^k)||j){
            if(len[k]<=len[i]-j){
                if(a[k]==((a[i]>>(len[i]-j-len[k]))&((1<<len[k])-1))&&dis[id[i][j+len[k]]]>dis[x])
                    dis[id[i][j+len[k]]]=dis[x],q.push({i,j+len[k],dis[x]+len[k]});
            }else{
                if((a[i]&((1<<len[i]-j)-1))==(a[k]>>len[k]-len[i]+j)&&dis[id[k][len[i]-j]]>dis[x]+len[k]-len[i]+j)
                    dis[id[k][len[i]-j]]=dis[x]+len[k]-len[i]+j,q.push({k,len[i]-j,dis[id[k][len[i]-j]]});
            }
        }
    }
    if(vis[ed]) printf("%d",dis[ed]);
    else puts("0");
    return 0;
}