#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;

int main() {
    int n, d[1003][17] = {}, l[1003] = {}, z = mod;
    bool b[1003][17] = {};
    string s[1003] = {};
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> s[i], l[i] = (int)s[i].length();
    for (int i = 1; i <= n; i++) for (int j = 0; j <= 16; j++) d[i][j] = mod;
    priority_queue<pair<int, pii>, vector<pair<int, pii>>, greater<pair<int, pii>>> q;
    for (int i = 1; i <= n; i++) for (int j = 1; j < i; j++) {
        if (l[i] > l[j]) {
            if (s[i].substr(0, l[j]) == s[j]) {
                d[i][l[i] - l[j]] = l[i];
                q.push({l[j], {i, l[i] - l[j]}});
            }
        } else {
            if (s[j].substr(0, l[i]) == s[i]) {
                d[j][l[j] - l[i]] = l[j];
                q.push({l[i], {j, l[j] - l[i]}});
            }
        }
    }
    while (!q.empty()) {
        int x = q.top().second.first, y = q.top().second.second;
        q.pop();
        if (b[x][y]) continue; b[x][y] = 1;
        for (int i = 1; i <= n; i++) {
            if (l[i] <= y) {
                if (s[i] == s[x].substr(l[x] - l[i], l[i])) {
                    if (d[x][y - l[i]] > d[x][y]) {
                        d[x][y - l[i]] = d[x][y];
                        q.push({d[x][y - l[i]], {x, y - l[i]}});
                    }
                }
            } else {
                if (s[i].substr(0, y) == s[x].substr(l[x] - y, y)) {
                    if (d[i][l[i] - y] > d[x][y] + l[i] - y) {
                        d[i][l[i] - y] = d[x][y] + l[i] - y;
                        q.push({d[i][l[i] - y], {i, l[i] - y}});
                    }
                }
            }
        }
    }
    //for (int i = 1; i <= n; i++) for (int j = 0; j <= 5; j++) cout << d[i][j] << " \n"[j == 5];
    for (int i = 1; i <= n; i++) z = min(z, d[i][0]);
    if (z == mod) z = 0;
    cout << z << '\n';
}