#include<bits/stdc++.h>
using namespace std;
int const N = 1005;
string a[N];
int len[N];
vector<pair < pair<int, int>, int> > graph[N][16];
int dest[N][16];
int dis[N][16];
bool vis[N][16];
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    for(int i = 0; i < n; i++){
        cin >> a[i];
        len[i] = a[i].size();
        for(int j = 0; j < len[i]; j++){
            dis[i][j] = 1e9;
        }
    }
    dis[n][0] = 1e9;
    for(int i = 0; i < n; i++){
        for(int k = 0; k < len[i]; k++){
            for(int j = 0; j < n; j++){
                if(i == j)
                    continue;
                bool can_add = 1;
                for(int t = 0; t < min(len[i] - k, len[j]); t++){
                    if(a[i][k + t] != a[j][t]){
                        can_add = 0;
                        break;
                    }
                }
                if(can_add){
                    if(len[i] - k < len[j]){
                        graph[i][k].push_back({{j, (len[i] - k)}, len[i] - k});
                    }else if(len[i] - k == len[j]){
                        dest[i][k] = len[j];
                        break;
                    }else{
                        graph[i][k].push_back({{i, k + len[j]}, len[j]});
                    }
                }
            }
        }
    }
    // for(int i = 0; i < n; i++){
    //     for(int k = 0; k < len[i]; k++){
    //         for(auto &j : graph[i][k]){
    //             cerr << i << ' ' << k << ' ' << j.first.first << ' ' << j.first.second << ' ' << j.second << '\n';
    //         }
    //     }
    // }
    priority_queue<pair<int, pair<int, int> >, vector<pair<int, pair<int, int> > >, greater<pair<int, pair<int, int> > > > pq;
    for(int i = 0; i < n; i++){
        pq.push({0, {i, 0}});
        dis[i][0] = 0;
    }
    while(!pq.empty()){
        auto top = pq.top();
        pq.pop();
        if(top.second.first == n){
            break;
        }
        if(vis[top.second.first][top.second.second]){
            continue;
        }
        vis[top.second.first][top.second.second] = 1;
        if(dest[top.second.first][top.second.second]){
            if(dis[n][0] > top.first + dest[top.second.first][top.second.second]){
                dis[n][0] = top.first + dest[top.second.first][top.second.second];
                pq.push({dis[n][0], {n, 0}});
            }
            continue;
        }
        for(auto &i : graph[top.second.first][top.second.second]){
            if(dis[i.first.first][i.first.second] > top.first + i.second){
                dis[i.first.first][i.first.second] = top.first + i.second;
                pq.push({dis[i.first.first][i.first.second], i.first});
            }
        }
    }
    if(dis[n][0] == 1e9){
        cout << 0 << '\n';
    }else{
        cout << dis[n][0] << '\n';
    }
}