#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <ctime>
#include <complex>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    rep(i,a.size()) cout << a[i] << " ";
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
ll pcount(ll x) {return __builtin_popcountll(x);}
const int mod = 1e9 + 7;
//const int mod = 998244353;

map<string,ll> mp;

int main(){
	int n; cin >> n;
	vs s(n); rep(i,n) cin >> s[i];
	priority_queue<pair<ll,string>> pq;
	auto push = [&](string s, ll c){
		if(mp.find(s) != mp.end()){
			if(mp[s] > c){
				mp[s] = c;
				pq.emplace(c,s);
			}
		}else{
			mp[s] = c;
			pq.emplace(c,s);
		}
	};
	rep(i,n){
		pq.emplace(0,s[i]);
	}
	while(!pq.empty()){
		auto p = pq.top(); pq.pop();
		rep(i,n){
			if(p.first == 0 && s[i] == p.second) continue;
			int si = s[i].size(), sp = p.second.size();
			if(si < sp){
				string t = p.second.substr(0,si);
				if(t == s[i]){
					push(p.second.substr(si,sp-si), si+p.first);
				}
			}else{
				string t = s[i].substr(0,sp);
				if(t == p.second){
					push(s[i].substr(sp,si-sp), sp+p.first);
				}
			}
		}
	}
	cout << mp[""] << endl;
}
