#include <bits/stdc++.h>
#include <cstring>
using namespace std;
#define sx(s) (int)(s.size())
string s[22];
int cost[22][22];
int n,dp[1<<20];
int getbit(int i,int t){ return (t >> i) & 1; }
int bit(int i) { return 1 << i; }
int lcs(const string &s, const string &t){
    int f[102][102];
    memset(f, 0, sizeof f);
    for (int i = 1; i < sx(s); i++){
        for (int j = 1; j < sx(t); j++){
            if (s[i] == t[j]) f[i][j] = f[i-1][j-1] + 1;
            else f[i][j] = max(f[i-1][j],f[i][j-1]);
        }
    }
    return f[sx(s)-1][sx(t)-1];
}
void update(int &f,int val){

    if (val < f) f = val;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);  cout.tie(0);
    cin >> n;
    for (int i = 0; i < 2*n; i++){
        cin >> s[i];
        s[i] = ' ' + s[i];
    }
    for (int i = 0; i < 2*n; i++){
        for (int j = i+1; j < 2*n; j++){
            cost[i][j] = sx(s[i]) + sx(s[j]) - lcs(s[i], s[j]) - 2;
        }
    }
    for (int i = 0; i < bit(2*n); i++) dp[i] = 11001010;
    dp[0] = 0;
    for (int st = 0; st < bit(2*n); st++){
        for (int i = 0; i < 2*n; i++){
            if (getbit(i,st)) continue;
            for (int j = i+1; j < 2*n; j++){
                if (getbit(j,st)) continue;
                update(dp[st+bit(i)+bit(j)], max(dp[st], cost[i][j]));
            }
        }
    }
    cout << dp[bit(2*n)-1];
    return 0;
}

 $\color{#1fdb91}{\texttt{Mazh}}\color{#0aaec9}{\texttt{fan}}\color{#e9418e}{\texttt{Jack}}$

#include<bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int LIM = 111;
int n, k;
string a[111];
int cost[111][111];
string u, v;
int f[111][111];
int calc(int i = 0, int j = 0)
{
    if (i >= u.size()) return int(v.size()) - j; 
    if (j >= v.size()) return int(u.size()) - i; 

    int &res = f[i][j];
    if (res != -1) return res;
    res = +INF;

    res = min(calc(i + 1, j), calc(i, j + 1)) + 1;
    if (u[i] == v[j])
        minimize(res, calc(i + 1, j + 1) + 1);

    return res;
}
int g[1 << 22];
int solve(int i = 1, int mask = 0)
{
    if (i > n) return 0;
    if (mask >> i & 1) return solve(i + 1, mask);

    int &res = g[mask];
    if (res != -1) return res;
    res = +INF;

    for (int j = i + 1; j <= n; ++j)
    {
        if (mask >> j & 1) continue; /// (j) is used
        minimize(res, max(solve(i + 1, mask | (1 << j)), cost[i][j]));
    }

    return res;
}
int main()
{
    cin >> n;
    k = 1 * n;
    n = 2 * n;
    for (int i = 1; i <= n; ++i)
        cin >> a[i];

    for (int i = 1; i <= n; ++i)
    {
        for (int j = i + 1; j <= n; ++j)
        {
            u = a[i];
            v = a[j];
            memset(f, -1, sizeof(f));
            cost[i][j] = cost[j][i] = calc();
        }
    }
    memset(g, -1, sizeof(g));
    cout << solve();
    return 0;
}