Problem: Recent improvements in information and communication technology have made it possible to provide municipal service to a wider area more quickly and with less costs. Stimulated by this, and probably for saving their not sufficient funds, mayors of many cities started to discuss on mergers of their cities.

There are, of course, many obstacles to actually put the planned mergers in practice. Each city has its own culture of which citizens are proud. One of the largest sources of friction is with the name of the new city. All citizens would insist that the name of the new city should have the original name of their own city at least as a part of it. Simply concatenating all the original names would, however, make the name too long for everyday use.

You are asked by a group of mayors to write a program that finds the shortest possible name for the new city that includes all the original names of the merged cities. If two or more cities have common parts, they can be overlapped. For example, if "FUKUOKA", "OKAYAMA", and "YAMAGUCHI" cities are to be merged, "FUKUOKAYAMAGUCHI" is such a name that include all three of the original city names. Although this includes all the characters of the city name "FUKUYAMA" in this order, it does not appear as a consecutive substring, and thus "FUKUYAMA" is not considered to be included in the name.



Input

The input is a sequence of datasets. Each dataset begins with a line containing a positive integer n (n ≤ 14), which denotes the number of cities to be merged. The following n lines contain the names of the cities in uppercase alphabetical letters, one in each line. You may assume that none of the original city names has more than 20 characters. Of course, no two cities have the same name.

The end of the input is indicated by a line consisting of a zero.

Output

For each dataset, output the length of the shortest possible name of the new city in one line. The output should not contain any other characters.

Examples

Input

3


Output

16


Input

3
FUKUOKA
OKAYAMA
YAMAGUCHI
3
FUKUOKA
FUKUYAMA
OKAYAMA
2
ABCDE
EDCBA
4
GA
DEFG
CDDE
ABCD
2
ABCDE
C
14
AAAAA
BBBBB
CCCCC
DDDDD
EEEEE
FFFFF
GGGGG
HHHHH
IIIII
JJJJJ
KKKKK
LLLLL
MMMMM
NNNNN
0


Output

16
19
9
9
5
70

Solution (in CPP):

Solution:
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-11;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
ll dp[1 << 14][14];
int main(){
	int n;
	while (cin >> n, n) {
		//iの次にjをつなげる時にカットされるコスト
		int d[14][14];
		vector<string> a;
		rep(i, n) {
			string in; cin >> in;
			a.push_back(in);
		}
		bool del[14];
		fill(del, del + 14, false);
		//a[i]がa[j]に吸収されるか？
		rep(i, n) {
			rep(j, n) {
				if (i == j)continue;
				int n1 = a[i].length();
				int n2 = a[j].length();
				if (n1 > n2)continue;
				rep(k, n2 - n1 + 1) {
					if (a[i] == a[j].substr(k, n1))del[i] = true;
				}
			}
		}
		per(i, n) {
			if (del[i]) {
				a.erase(a.begin() + i);
			}
		}
		n = a.size();
		ll sum = 0;
		rep(i, n) {
			sum += a[i].length();
		}
		rep(i, n) {
			rep(j, n) {
				if (i == j)continue;
				int n1 = a[i].length();
				int n2 = a[j].length();
				int m = min(n1,n2);
				int ma1 = 0;
				rep1(k, m) {
					if (a[i].substr(n1 - k, k) == a[j].substr(0, k))ma1 = k;
				}
				d[i][j] = ma1;
			}
		}
		rep(i, 1 << n) {
			rep(j, n) {
				dp[i][j] = 0;
			}
		}
		rep(i, 1 << n) {
			rep(j, n) {
				if (i&(1 << j)) {
					int k = i ^ (1 << j);
					rep(l, n) {
						if (l == j)continue;
						if (!(i&(1 << l)))continue;
						dp[i][j] = max(dp[i][j], dp[k][l]+d[l][j]);
					}
				}
			}
		}
		ll ma = 0;
		rep(i, n) {
			ma = max(ma, dp[(1 << n) - 1][i]);
		}
		cout << sum - ma << endl;
	}
	return 0;
}