import java.io.*;
import java.util.*;

public class Main {

    static int N;
    static String[] S;

    public static void main(String[] args) {
        FastScanner sc = new FastScanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        while(true) {
            N = sc.nextInt();
            if( N == 0 ) break;

            S = new String[N];
            for (int i = 0; i < N; i++) {
                S[i] = sc.next();
            }
            pw.println( solve() );
        }
        pw.flush();
    }

    static int solve() {
        S = removeContained();
        N = S.length;

        int[][] overlap = calcOverlaps();

        int[][] dp = new int[1 << N][N];
        for (int[] row : dp) {
            Arrays.fill(row, 1_000_000_000);
        }
        for (int i = 0; i < N; i++) {
            dp[1 << i][i] = S[i].length();
        }
        for (int s = 1; s < 1<<N; s++) {
            for (int last = 0; last < N; last++) {
                for (int i = 0; i < N; i++) {
                    if( (s & (1 << i)) > 0 ) continue;

                    dp[s | (1 << i)][i] = Math.min(dp[s | (1 << i)][i], dp[s][last] + S[i].length() - overlap[last][i]);
                    // debug(Integer.toBinaryString(s), last,"+", i, "->", s | (1 << i), i, dp[s | (1 << i)][i]);
                }
            }
        }

        int ans = Integer.MAX_VALUE;
        for (int i = 0; i < N; i++) {
            if( dp[(1 << N)-1][i] == - 1 ) continue;
            ans = Math.min(ans, dp[(1 << N)-1][i]);
        }
        return ans;
    }

    static int[][] calcOverlaps() {
        int[][] overlap = new int[N][N];
        for (int i = 0; i < N; i++) {
            String s = S[i];
            for (int j = 0; j < N; j++) {
                if( i == j ) continue;

                String t = S[j];
                overlap[i][j] = countOverlap(s, t);
            }
        }
        return overlap;
    }

    static int countOverlap(String s, String t) {
        int count = 0;
        for (int i = 1; i <= t.length(); i++) {
            String prefix = t.substring(0, i);
            if( s.endsWith(prefix) ) {
                count = i;
            }
        }
        return count;
    }

    static String[] removeContained() {
        boolean[] contained = new boolean[N];

        for (int i = 0; i < N; i++) {
            String s = S[i];
            for (int j = 0; j < N; j++) {
                if( i == j ) continue;

                String t = S[j];
                if( t.contains(s) ) {
                    contained[i] = true;
                }
            }
        }

        List<String> ok = new ArrayList<>();
        for (int i = 0; i < N; i++) {
            if( !contained[i] ) {
                ok.add(S[i]);
            }
        }
        return ok.toArray(new String[0]);
    }

    @SuppressWarnings("unused")
    static class FastScanner {
        private BufferedReader reader;
        private StringTokenizer tokenizer;

        FastScanner(InputStream in) {
            reader = new BufferedReader(new InputStreamReader(in));
            tokenizer = null;
        }

        String next() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        String nextLine() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    return reader.readLine();
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken("\n");
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) a[i] = nextInt();
            return a;
        }

        int[] nextIntArray(int n, int delta) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) a[i] = nextInt() + delta;
            return a;
        }

        long[] nextLongArray(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++) a[i] = nextLong();
            return a;
        }
    }

    static void writeLines(int[] as) {
        PrintWriter pw = new PrintWriter(System.out);
        for (int a : as) pw.println(a);
        pw.flush();
    }

    static void writeLines(long[] as) {
        PrintWriter pw = new PrintWriter(System.out);
        for (long a : as) pw.println(a);
        pw.flush();
    }

    static void writeSingleLine(int[] as) {
        PrintWriter pw = new PrintWriter(System.out);
        for (int i = 0; i < as.length; i++) {
            if (i != 0) pw.print(" ");
            pw.print(as[i]);
        }
        pw.println();
        pw.flush();
    }

    static int max(int... as) {
        int max = Integer.MIN_VALUE;
        for (int a : as) max = Math.max(a, max);
        return max;
    }

    static int min(int... as) {
        int min = Integer.MAX_VALUE;
        for (int a : as) min = Math.min(a, min);
        return min;
    }

    static void debug(Object... args) {
        StringJoiner j = new StringJoiner(" ");
        for (Object arg : args) {
            if (arg == null) j.add("null");
            else if (arg instanceof int[]) j.add(Arrays.toString((int[]) arg));
            else if (arg instanceof long[]) j.add(Arrays.toString((long[]) arg));
            else if (arg instanceof double[]) j.add(Arrays.toString((double[]) arg));
            else if (arg instanceof Object[]) j.add(Arrays.toString((Object[]) arg));
            else j.add(arg.toString());
        }
        System.err.println(j.toString());
    }

    static void printSingleLine(int[] array) {
        PrintWriter pw = new PrintWriter(System.out);
        for (int i = 0; i < array.length; i++) {
            if (i != 0) pw.print(" ");
            pw.print(array[i]);
        }
        pw.println();
        pw.flush();
    }

    static int lowerBound(int[] array, int value) {
        int lo = 0, hi = array.length, mid;
        while (lo < hi) {
            mid = (hi + lo) / 2;
            if (array[mid] < value) lo = mid + 1;
            else hi = mid;
        }
        return lo;
    }

    static int upperBound(int[] array, int value) {
        int lo = 0, hi = array.length, mid;
        while (lo < hi) {
            mid = (hi + lo) / 2;
            if (array[mid] <= value) lo = mid + 1;
            else hi = mid;
        }
        return lo;
    }
}



Measured memory_bytes: 59476