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

#ifdef genshin
#include <experimental/iterator>
#endif
const int INF = 0x3F3F3F3F;
const int maxn = 16;
priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, greater<tuple<int, int, int>>> Q;
int dis[maxn + 1][1 << maxn];
signed main() { ios::sync_with_stdio(0); cin.tie(0);
    int n;
    cin >> n;
    vector<pair<int, int>> num(n+1); // len, mask
    for(int i=1;i<=n;++i){
		string s;cin>>s;
        int x=0,len=0;
        for(char c:s)x|=(c&1)<<len,++len;
        num[i]={s.size(),x};
	}
    memset(dis, 0x3f, sizeof dis);
    for(int i=1;i<=n;++i)/*初始化*/
		for(int j=1;j<=n;++j){
			int len1=num[i].first,len2=num[j].first,val1=num[i].second,val2=num[j].second;
			if((len1==len2&&val1==val2)||len1<len2)continue;
			if((val1&((1<<len2)-1))!=val2)continue;
			int nxt_len=len1-len2,nxt_val=val1>>len2;
			if(dis[nxt_len][nxt_val]>len1)dis[nxt_len][nxt_val]=len1,Q.push({len1,nxt_len,nxt_val});
		}
	while(!Q.empty()){
		auto [d,len,val]=Q.top();Q.pop();
		if(d>dis[len][val])continue;
		for(int i=1;i<=n;++i){
			int len2=num[i].first,val2=num[i].second,nxt_len,nxt_val,flag=0;
			if(len>=len2&&((val&((1<<len2)-1))==val2))nxt_len=len-len2,nxt_val=val>>len2,flag=1;
			else if(len<len2&&(val2&((1<<len)-1))==val)nxt_len=len2-len,nxt_val=val2>>len,flag=1;
			if(!flag)continue;
			int cost=max(0,len2-len);
			if(d+cost<dis[nxt_len][nxt_val])dis[nxt_len][nxt_val]=d+cost,Q.push({d+cost,nxt_len,nxt_val});
		}
	}
    if (dis[0][0] == INF)
        cout << "0\n";
    else
        cout << dis[0][0] << '\n';
}