#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <fstream>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v;}
template<class T> inline string toStr(T x) { ostringstream sout; sout << x; return sout.str();}
typedef vector<int> vi;
typedef vector<vi>  vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,(n)-1)
const double EPS = 1e-12;
const double PI = acos(-1.0);
const int INF = INT_MAX/10;

string merge(string a, string b) {
	int al = a.length(), bl = b.length();
	string res = a+b;
	FOR(i, 1, min(al, bl)) {
		string as = a.substr(al-i);
		string bs = b.substr(0, i);
		if(as == bs) {
			res = a+b.substr(i);
		}
	}
	return res;
}

int diffstr(string a, string b) {
	return merge(a, b).length()-a.length();
}

int main() {
	int N;
	while(cin >> N, N) {
		vs data(N);
		REP(i, N) {
			cin >> data[i];
		}

		vs city;
		REP(i, N) {
			bool ok = true;
			REP(j, N) {
				if(i != j && data[j].find(data[i]) != string::npos) {
					ok = false;
					break;
				}
			}
			if(ok) {
				city.push_back(data[i]);
			}
		}

		N = city.size();
		vvi diff(N, vi(N));
		REP(i, N) {
			REP(j, N) {
				diff[i][j] = diffstr(city[i], city[j]);
			}
		}

		vvi dp(1<<N, vi(N, INF));
		REP(i, 1<<N) {
			if(i == 0) {
				REP(j, N) {
					dp[1<<j][j] = city[j].length();
				}
				continue;
			}

			REP(j, N) {
				if(i&(1<<j)) {
					REP(k, N) {
						if(j != k && !(i&(1<<k))) {
							dp[i|(1<<k)][k] = min(dp[i|(1<<k)][k], dp[i][j]+diff[j][k]);
						}
					}
				}
			}
		}

		int ans = INF;
		REP(i, N) {
			ans = min(ans, dp[(1<<N)-1][i]);
		}
		cout << ans << endl;
	}
}