// Giải thuật ac cho bài toán ac-word-min\n#include <bits/stdc++.h>
using namespace std;

const int ALPHABET = 26;

struct AhoCorasick {
    struct Node {
        int next[ALPHABET];
        int fail, dict;
        int minLen;
        Node() {
            fill(next, next + ALPHABET, -1);
            fail = dict = -1;
            minLen = 1e9;
        }
    };
    vector<Node> trie;
    AhoCorasick() { trie.emplace_back(); }
    void insert(const string& s) {
        int node = 0;
        for (char ch : s) {
            int c = ch - 'a';
            if (trie[node].next[c] == -1) {
                trie[node].next[c] = trie.size();
                trie.emplace_back();
            }
            node = trie[node].next[c];
        }
        trie[node].minLen = min(trie[node].minLen, (int)s.size());
    }
    void build() {
        queue<int> q;
        for (int c = 0; c < ALPHABET; c++) {
            if (trie[0].next[c] != -1) {
                trie[trie[0].next[c]].fail = 0;
                q.push(trie[0].next[c]);
            } else {
                trie[0].next[c] = 0;
            }
        }
        while (!q.empty()) {
            int u = q.front(); q.pop();
            if (trie[trie[u].fail].minLen < trie[u].minLen)
                trie[u].minLen = trie[trie[u].fail].minLen;
            for (int c = 0; c < ALPHABET; c++) {
                if (trie[u].next[c] != -1) {
                    trie[trie[u].next[c]].fail = trie[trie[u].fail].next[c];
                    q.push(trie[u].next[c]);
                } else {
                    trie[u].next[c] = trie[trie[u].fail].next[c];
                }
            }
        }
    }
};

int main() {
    // Doc du lieu dau vao
    ios::sync_with_stdio(false); cin.tie(0);
    string t; cin >> t;
    int k; cin >> k;
    AhoCorasick aho;
    for (int i = 0; i < k; i++) {
        string s; cin >> s;
        aho.insert(s);
    }
    aho.build();
    int ans = 1e9;
    int node = 0;
    for (int i = 0; i < (int)t.size(); i++) {
        int c = t[i] - 'a';
        node = aho.trie[node].next[c];
        int bestMatch = aho.trie[node].minLen;
        if (bestMatch <= i + 1)
            ans = min(ans, bestMatch);
    }
    if (ans == 1e9) cout << -1 << "\n";
    else cout << ans << "\n";
    return 0;
}