#if __has_include("../library/Basic/Debug.hpp")

#include "../library/Basic/Debug.hpp"

#else

/* ----- Header Files ----- */
// IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>

// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>

// container
#include <vector>
#include <string>
#include <tuple>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>

// others
#include <random>
#include <limits>
#include <functional>
#include <ctime>
#include <cassert>
#include <cstdint>


/* ----- Type Alias ----- */
using Bool = bool;
using Int = long long int;
using Real = long double;
using Char = char;
using String = std::string;
template <class... Ts>
using Tuple = std::tuple<Ts...>;

template <class T>
using Vector = std::vector<T>;
template <class T>
using Matrix = Vector<Vector<T>>;
template <class T>
using Queue = std::queue<T>;
template <class T>
using Stack = std::stack<T>;
template <class T>
using Deque = std::deque<T>;

template <class T>
using MaxHeap = std::priority_queue<T>;
template <class T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <class T>
using Set = std::set<T>;
template <class T, class U>
using Map = std::map<T, U>;

template <class T, class... Us>
using Func = std::function<T(Us...)>;

template <class T>
T genv(T v) { return v; }

template <class T, class... Ts>
auto genv(size_t l, Ts... ts) {
    return Vector<decltype(genv<T>(ts...))>(l, genv<T>(ts...));
}

template <class Cost = Int>
struct Edge {
    Int src, dst;
    Cost cost;
    Edge(Int src = -1, Int dst = -1, Cost cost = 1)
        : src(src), dst(dst), cost(cost){};

    bool operator<(const Edge<Cost>& e) const { return this->cost < e.cost; }
    bool operator>(const Edge<Cost>& e) const { return this->cost > e.cost; }
};

template <class Cost = Int>
using Edges = Vector<Edge<Cost>>;
template <class Cost = Int>
using Graph = Vector<Vector<Edge<Cost>>>;

#endif

/* ----- Misc ----- */
void fastio() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
}

struct Fout {
    Int precision;
    Fout(Int precision) : precision(precision) {}
};
std::ostream& operator<<(std::ostream& os, const Fout& fio) {
    os << std::fixed << std::setprecision(fio.precision);
    return os;
}


/* ----- Constants ----- */
constexpr Int INF = std::numeric_limits<Int>::max() / 3;
// constexpr Int MOD = 1000000007;
// constexpr Real PI = acos(-1);
// constexpr Real EPS = 1e-10;
// std::mt19937 mt(int(std::time(nullptr)));

Bool solve() {
    Int n;
    std::cin >> n;
    if (n == 0) return false;

    Vector<String> s(n);
    for (auto& x : s) std::cin >> x;

    for (auto it = s.begin(); it != s.end();) {
        Bool contained = false;
        for (auto lit = s.begin(); lit != s.end(); ++lit) {
            if (it == lit) continue;
            if (lit->find(*it) != String::npos) {
                contained = true;
            }
        }

        if (contained) {
            it = s.erase(it);
        } else {
            ++it;
        }
    }

    n = s.size();
    Matrix<Int> cost(n, Vector<Int>(n));
    for (Int i = 0; i < n; ++i) {
        for (Int j = 0; j < n; ++j) {
            // s[i]の後にs[j]を繋げるときの追加コスト
            for (Int k = 0;; ++k) {
                // s[i][k:li-1]とs[j][0:li-k-1]が合致すればOK
                // このときコストはlj-(li-k)
                if (s[i].substr(k) == s[j].substr(0, s[i].length() - k)) {
                    cost[i][j] = s[j].length() - s[i].length() + k;
                    break;
                }
            }
        }
    }

    auto dp = genv<Int>(1 << n, n, INF);
    for (Int i = 0; i < n; ++i) {
        dp[1 << i][i] = s[i].length();
    }

    for (Int b = 0; b < (1 << n); ++b) {
        for (Int i = 0; i < n; ++i) {
            if (((b >> i) & 1) == 0) continue;
            for (Int j = 0; j < n; ++j) {
                if (i == j || ((b >> j) & 1)) continue;
                dp[b + (1 << j)][j] =
                    std::min(dp[b + (1 << j)][j], dp[b][i] + cost[i][j]);
            }
        }
    }

    Int ans = *std::min_element(dp.back().begin(), dp.back().end());
    std::cout << ans << std::endl;
    return true;
}

int main() {
    while (solve()) {}
    return 0;
}



Measured memory_bytes: 5308