#include "bits/stdc++.h"
#include <sys/timeb.h>
#include <fstream>

using namespace std;

#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define replrev(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)
#define reprev(i,n) replrev(i,0,n)
#define repi(itr,ds) for(auto itr=ds.begin();itr!=ds.end();itr++)
#define all(a) a.begin(),a.end()
#define mp make_pair
#define mt make_tuple
#define INF 2000000000
#define INFL 1000000000000000000LL
#define EPS (1e-10)
#define MOD 1000000007
#define PI 3.1415926536
#define RMAX 4294967295

typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<P> vP;
typedef vector<vector<int> > vvi;
typedef vector<vector<bool> > vvb;
typedef vector<vector<ll> > vvll;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<double> > vvd;
typedef vector<vector<P> > vvP;
typedef priority_queue<int, vector<int>, greater<int> > pqli;
typedef priority_queue<ll, vector<ll>, greater<ll> > pqlll;
typedef priority_queue<P, vector<P>, greater<P> > pqlP;
typedef pair<int, pair<int, int> > Edge;
typedef vector<Edge> vE;
typedef priority_queue<Edge, vector<Edge>, greater<Edge> > pqlE;

vvi G;
int N;
vvi dp;

int tsp(int pos, int visited) {
	if (visited == (1 << N) - 1) {
		return 0;
	}
	if (dp[visited][pos] != -1) {
		return dp[visited][pos];
	}
	int ans = INF;
	rep(i, N) {
		if ((visited & (1 << i)) != 0)continue;
		ans = min(ans, G[pos][i] + tsp(i, visited | (1 << i)));
	}
	return dp[visited][pos] = ans;
}

int main() {
	while (true) {
		cin >> N;
		if (N == 0)break;
		vs name(N);
		rep(i, N)cin >> name[i];
		vb del(N, false);
		// ???????????¨????????????????????????????????´???????¶????
		rep(i, N) {
			rep(j, N) {
				// i???j??????????????????
				if (i == j || name[i].size() > name[j].size())continue;
				// i?????????????????????????£????0???J-I
				bool flag2 = false;
				rep(k, name[j].size() - name[i].size() + 1) {
					bool flag = true;
					rep(l, name[i].size()) {
						if (name[j][k + l] != name[i][l]) {
							flag = false;
							break;
						}
					}
					if (flag) {
						// ????????????
						flag2 = true;
						break;
					}
				}
				if (flag2) {
					// ?????????????????§i?????????
					del[i] = true;
					break;
				}
			}
		}

		vs tmp;
		rep(i, N) {
			if (!del[i]) {
				tmp.push_back(name[i]);
			}
		}
		name = tmp;
		N = name.size();

		G = vvi(N, vi(N, 0));
		dp = vvi(1 << N, vi(N, -1));
		rep(i, N) {
			rep(j, N) {
				if (i == j)continue;
				int maxk = 0;
				repl(k, 1, min(name[i].size(), name[j].size())){
					// name[i]?????????k????????¨name[j]?????????k???????????????
					bool flag = true;
					rep(l, k) {
						if (name[i][name[i].size() - k + l] != name[j][l]) {
							flag = false;
							break;
						}
					}
					if (flag)maxk = k;
				}
				G[i][j] = name[j].size() - maxk;
			}
		}
		int ans = INF;
		rep(i, N) {
			ans = min(ans, tsp(i, 1 << i) + (int)name[i].size());
		}
		cout << ans << endl;
	}

	return 0;
}