#include <bits/stdc++.h>
using namespace std;

const int N = 4e5 + 10;

int n, m, q, f[N], T, tot, last, pre[N];

char s1[N], s2[N];

vector<int> e[N];

struct Node {
    int tr[26], fa, len, mn;
} t[N];

void init_(int x) {
    t[x].fa = 0, t[x].mn = 1e8;
    memset(t[x].tr, 0, sizeof(t[x].tr));
    e[x].clear();
}

void ext_(int k) {
    int p = last, x;

    /* if (t[p].tr[k]) {
         x = t[p].tr[k];
         t[x].mn = min(t[x].mn, m);
         last = x;
         return;
     }*/

    init_(x = ++tot);
    t[x].len = t[p].len + 1;
    t[x].mn = m;

    while (p && !t[p].tr[k]) {
        t[p].tr[k] = x;
        p = t[p].fa;
    }

    if (!p) {
        t[x].fa = 1;
    } else {
        int q = t[p].tr[k];

        if (t[p].len + 1 == t[q].len) {
            t[x].fa = q;
        } else {
            init_(++tot);
            t[tot] = t[q];
            t[tot].len = t[p].len + 1;
            t[q].fa = t[x].fa = tot;

            while (p && t[p].tr[k] == q) {
                t[p].tr[k] = tot;
                p = t[p].fa;
            }
        }
    }

    last = x;
}

void dfs1_(int u) {
    for (int v : e[u]) {
        dfs1_(v);
        t[u].mn = min(t[u].mn, t[v].mn);
    }
}

void dfs2_(int u) {
    for (int v : e[u]) {
        if (t[u].mn < t[v].mn) {
            pre[v] = u;
        } else {
            pre[v] = pre[u];
        }

        dfs2_(v);
    }
}

void solve_() {
    scanf("%d", &q);
    f[0] = 1e9;

    while (q--) {
        scanf("%s", s2 + 1), m = strlen(s2 + 1), last = 1;
        f[0] = min(f[0], m);

        for (int i = 1; i <= m; i++) {
            ext_(s2[i] - 'a');
        }
    }

    scanf("%s", s1 + 1);
    n = strlen(s1 + 1);

    for (int i = 2; i <= tot; i++) {
        e[t[i].fa].push_back(i);
    }

    dfs1_(1);
    dfs2_(1);

    for (int x = 1, len = 0, i = 1; i <= n; i++) {
        while (x && !t[x].tr[s1[i] - 'a']) {
            x = t[x].fa;
            len = t[x].len;
        }

        if (!x) {
            x = 1, len = 0;
        } else {
            x = t[x].tr[s1[i] - 'a'];
            len++;
        }

        f[i] = f[i - 1] + 1;

        int cnt = 0, y = x;

        f[i] = f[i - 1] + 1;

        while (y > 1) {
            f[i] = min(f[i],
                       min(f[i - min(t[y].len, len)], i - min(t[y].len, len)) + t[y].mn - min(t[y].len, len));

            if (f[i] < f[i - 1]) {
                break;
            }

            y = pre[y];
        }

        // printf("%d\n", f[i]);
        // assert(abs(f[i] - f[i - 1]) <= 1);
    }

    printf("%d\n", f[n]);
}

int main() {
    // freopen("in10.in" , "r+" , stdin);
    // freopen("in10.out" , "w+" , stdout);

    T = 1;

    while (T--) {
        init_(tot = 1);
        solve_();
    }
}