Problem: During the study of the Martians Petya clearly understood that the Martians are absolutely lazy. They like to sleep and don't like to wake up. 

Imagine a Martian who has exactly n eyes located in a row and numbered from the left to the right from 1 to n. When a Martian sleeps, he puts a patch on each eye (so that the Martian morning doesn't wake him up). The inner side of each patch has an uppercase Latin letter. So, when a Martian wakes up and opens all his eyes he sees a string s consisting of uppercase Latin letters. The string's length is n. 

"Ding dong!" — the alarm goes off. A Martian has already woken up but he hasn't opened any of his eyes. He feels that today is going to be a hard day, so he wants to open his eyes and see something good. The Martian considers only m Martian words beautiful. Besides, it is hard for him to open all eyes at once so early in the morning. So he opens two non-overlapping segments of consecutive eyes. More formally, the Martian chooses four numbers a, b, c, d, (1 ≤ a ≤ b < c ≤ d ≤ n) and opens all eyes with numbers i such that a ≤ i ≤ b or c ≤ i ≤ d. After the Martian opens the eyes he needs, he reads all the visible characters from the left to the right and thus, he sees some word.

Let's consider all different words the Martian can see in the morning. Your task is to find out how many beautiful words are among them.

Input

The first line contains a non-empty string s consisting of uppercase Latin letters. The strings' length is n (2 ≤ n ≤ 105). The second line contains an integer m (1 ≤ m ≤ 100) — the number of beautiful words. Next m lines contain the beautiful words pi, consisting of uppercase Latin letters. Their length is from 1 to 1000. All beautiful strings are pairwise different.

Output

Print the single integer — the number of different beautiful strings the Martian can see this morning.

Examples

Input

ABCBABA
2
BAAB
ABBA


Output

1

Note

Let's consider the sample test. There the Martian can get only the second beautiful string if he opens segments of eyes a = 1, b = 2 and c = 4, d = 5 or of he opens segments of eyes a = 1, b = 2 and c = 6, d = 7. 

Solution (in JAVA):

Solution:
// Codeforces Round #106
// Problem E -- Martian Strings
import java.io.*;
import java.util.*;

public class Main implements Runnable {
    BufferedReader reader;
    StringTokenizer tokenizer;
    PrintStream writer;

    Main() {
        reader = new BufferedReader(new InputStreamReader(System.in));
        tokenizer = new StringTokenizer("");
        writer = new PrintStream(new BufferedOutputStream(System.out));
    }

    String reverse(String string) {
        return new StringBuffer(string).reverse().toString();
    }

    class Node {
        int firstOccurance;
        Node fail, children[];

        Node() {
            firstOccurance = Integer.MAX_VALUE;
            fail = null;
            children = new Node[26];
        }
    }

    int[][] prepare(String text, String patterns[]) {
        Node root = new Node();
        for (String pattern : patterns) {
            Node pointer = root;
            for (int i = 0; i < pattern.length(); ++ i) {
                int token = pattern.charAt(i) - 'A';
                if (pointer.children[token] == null) {
                    pointer.children[token] = new Node();
                }
                pointer = pointer.children[token];
            }
        }
        Queue <Node> queue = new LinkedList <Node>();
        ArrayList <Node> order = new ArrayList <Node>();
        for (int token = 0; token < 26; ++ token) {
            if (root.children[token] != null) {
                root.children[token].fail = root;
                queue.offer(root.children[token]);
                order.add(root.children[token]);
            }
        }
        while (!queue.isEmpty()) {
            Node u = queue.poll();
            for (int token = 0; token < 26; ++ token) {
                if (u.children[token] != null) {
                    u.children[token].fail = root;
                    Node p = u;
                    while (p != root) {
                        p = p.fail;
                        if (p.children[token] != null) {
                            u.children[token].fail = p.children[token];
                            break;
                        }
                    }
                    queue.offer(u.children[token]);
                    order.add(u.children[token]);
                }
            }
        }
        {
            Node pointer = root;
            for (int i = 0; i < text.length(); ++ i) {
                int token = text.charAt(i) - 'A';
                if (pointer.children[token] != null) {
                    pointer = pointer.children[token];
                } else {
                    while (pointer != root) {
                        pointer = pointer.fail;
                        if (pointer.children[token] != null) {
                            pointer = pointer.children[token];
                            break;
                        }
                    }
                }
                pointer.firstOccurance = Math.min(pointer.firstOccurance, i);
            }
        }
        for (int i = order.size() - 1; i >= 0; -- i) {
            Node u = order.get(i);
            u.fail.firstOccurance = Math.min(u.fail.firstOccurance, u.firstOccurance);
        }
        int n = patterns.length;
        int result[][] = new int[n][];
        for (int i = 0; i < n; ++ i) {
            int m = patterns[i].length();
            result[i] = new int[m + 1];
            result[i][0] = -1;
            Node pointer = root;
            for (int j = 0; j < m; ++ j) {
                int token = patterns[i].charAt(j) - 'A';
                pointer = pointer.children[token];
                result[i][j + 1] = pointer.firstOccurance;
            }
        }
        return result;
    }

    public void run() {
        try {
            String text = nextToken();
            String reversedText = reverse(text);
            int n = nextInt();
            String patterns[] = new String[n];
            String reversedPatterns[] = new String[n];
            for (int i = 0; i < n; ++ i) {
                patterns[i] = nextToken();
                reversedPatterns[i] = reverse(patterns[i]);
            }
            int prefixOccurance[][] = prepare(text, patterns);
            int suffixOccurance[][] = prepare(reversedText, reversedPatterns);
//for (int i = 0; i < n; ++ i) {
//    int m = patterns[i].length();
//    for (int j = 0; j <= m; ++ j) {
//        System.out.printf("%d, ", prefixOccurance[i][j]);
//    }
//    System.out.println("");
//}
            int result = 0;
            for (int i = 0; i < n; ++ i) {
                int m = patterns[i].length();
                if (m >= 2) {
                    boolean found = false;
                    for (int j = 0; j <= m; ++ j) {
                        if (prefixOccurance[i][j] != Integer.MAX_VALUE && suffixOccurance[i][m - j] != Integer.MAX_VALUE && prefixOccurance[i][j] + 1 + suffixOccurance[i][m - j] + 1 <= text.length()) {
                            found = true;
                        }
                    }
                    if (found) {
                        result ++;
                    }
                }
            }
            System.out.println(result);
        } catch (IOException e) {
        }
    }

    String nextToken() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }

    int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    public static void main(String args[]) {
        new Thread(new Main()).run();
    }
}