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:
//package codeforces;

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

public class martianString {
	public static void main(String[] args){
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		OutputWriter out = new OutputWriter(outputStream);
		TaskE solver = new TaskE();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskE{
	private final int N = 100100;
	
	public void solve(int testNum, InputReader in, OutputWriter out){
		String s = in.readString();
		int n = s.length() - 1;  // s[1...n]
		String rs = StringUtils.reverse(s);
		int ntest = in.readInt();
		//System.out.println(ntest);
		String t;
		int ans = 0, k, m; 
		int[] f = new int[N]; 
		int[] mat = new int[N];
		int[] rmat = new int[N];
		
		while (ntest-- > 0){
			//out.print(ntest);
			t = in.readString();
			m = t.length() - 1;
			if (m == 1) continue;
			
			k = f[0] = -1;
			for (int i = 1; i <= m; i++){
				while (k >= 0 && t.charAt(k+1) != t.charAt(i)) k = f[k];
				++k; f[i] = k;
			}
			k = 0;
			for (int i = 1; i <= n; i++){
				while (k >= 0 && t.charAt(k+1) != s.charAt(i)) k = f[k];
				++k; mat[i] = k;
				if (k == m) k = f[k];
			}
			
			t = StringUtils.reverse(t);
			k = f[0] = -1;
			for (int i = 1; i <= m; i++){
				while (k >= 0 && t.charAt(k+1) != t.charAt(i)) k = f[k];
				++k; f[i] = k;
			}
			k = 0;
			for (int i = 1; i <= n; i++){
				while (k >= 0 && t.charAt(k+1) != rs.charAt(i)) k = f[k];
				++k; rmat[i] = k;
				if (k == m) k = f[k];
			}
			
			for (int i = 2; i <= n; i++){
				mat[i] = Math.max(mat[i], mat[i-1]);
				rmat[i] = Math.max(rmat[i],  rmat[i-1]);
			}
			int x, y;
			for (int i = 1; i < n; i++){
				x = mat[i]; y = rmat[n-i];
				if (x > 0 && y > 0 && x + y >= m){
					++ans; break;
				}
			}
		}
		out.println(ans);
	}
}

class InputReader{
	private InputStream stream;
	private byte[] buf = new byte[1024];
	private int cur, length;
	
	public InputReader(InputStream stream){
		this.stream = stream;
	}
	
	public int read(){
		if (length == -1) throw new InputMismatchException();
		if (cur >= length){
			cur = 0;
			try{
				length = stream.read(buf);
			} catch(IOException e){
				throw new InputMismatchException();
			}
			if (length <= 0) return -1;
		}
		return buf[cur++];
	}
	
	public int readInt(){
		int c = read();
		while (isSpace(c)) c = read();
		int sgn = 1;
		if (c == '-'){
			sgn = -1; c = read();
		}
		int res = 0;
		do {
			if (c < '0' || c > '9') throw new InputMismatchException();
			res *= 10; 
			res += c - '0';
			c = read();
		} while (!isSpace(c));
		return res * sgn;
	}
	
	public String readString(){
		int c = read();
		while (isSpace(c)) c = read();
		StringBuffer res = new StringBuffer();
		res.append('#'); //for making one-based
		do{
			res.appendCodePoint(c);
			c = read();
		} while (!isSpace(c));
		return res.toString();
	}
	
	public static boolean isSpace(int c){
		return c == -1 || c == ' ' || c == '\n' || c == '\t' || c == '\r';
	}
}


class OutputWriter{
	private final PrintWriter writer;
	
	public OutputWriter(OutputStream outputStream){
		writer = new PrintWriter(outputStream);
	}
	
	public void print(Object...objects){
		for (int i = 0; i < (int)objects.length; i++){
			if (i != 0) writer.print(' ');
			writer.print(objects[i]);
		}
	}
	
	public void println(Object...objects){
		print(objects);
		writer.println();
	}
	
	public void close(){
		writer.close();
	}
}


class StringUtils{
	public static String reverse(String sample){
		StringBuffer res = new StringBuffer();
		res.append('#'); // to make one-based
		for (int i = sample.length()-1; i > 0; i--)
			res.append(sample.charAt(i));
		return res.toString();
	}
}