//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <queue>

using namespace std;

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);
const int INF = 1e9;

int f(string& s, string& t){
  for(int i=min(SZ(t),SZ(s));i>=1;--i){
	if(t.substr(0,i) == s.substr(SZ(s)-i,i)){
	  return i;
	}
  }
  return 0;
}

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int N;
  while(cin >> N,N){
	VS vs, vs_(N);
	REP(i,N) cin >> vs_[i];
	vector<bool> use(N, true);
	REP(i,N){
	  REP(j,N){
		if(i == j) continue;
		if(vs_[i].find(vs_[j], 0) != string::npos){
		  use[j] = false;
		}
	  }
	}
	REP(i,N) if(use[i]) vs.PB(vs_[i]);
	N = SZ(vs);

	int G[20][20];
	for(int i=0;i<N;++i){
	  for(int j=0;j<N;++j){
		if(i == j) continue;
		G[i][j] = f(vs[i], vs[j]);
	  }
	}

	VVI dp(1<<N, VI(N, -INF));
	for(int i=0;i<N;++i)
	  dp[1<<i][i] = 0;
	for(int b=1;b<(1<<N);++b){
	  for(int i=0;i<N;++i){
		if(b >> i & 1){
		  for(int j=0;j<N;++j){
			if(b >> j & 1) continue;
			dp[b|(1<<j)][j] = max(dp[b|(1<<j)][j], dp[b][i] + G[i][j]);
		  }
		}
	  }
	}

	int ans = 0;
	for(int i=0;i<N;++i)
	  ans = max(ans, dp[(1<<N)-1][i]);
	REP(i,N) ans -= SZ(vs[i]);
	cout << -ans << endl;
  }
  return 0;
}