#include <iostream>
#include <fstream>
#include <string>
#include <bitset>
#include <vector>

using namespace std;

typedef long long lint;

lint cv(char c){
	return c-'a';
}

bitset<10000141> bi;
bitset<5000741> wi;
struct roller{
	const lint modit, alp = 3;
	lint val = 0, rm = 1;
	roller(lint modit) : modit(modit){}
	void extend(char a){
		val = ((val*alp)+cv(a)) % modit;
		rm = (rm*alp) % modit;
	}
	void extend(const string &s){
		for(auto c : s){
			extend(c);
		}
	}
	void roll(char a, char b){
		val = (val*alp) - rm*cv(a) + cv(b);
		val = (val+modit*100) % modit;
	}
};

struct broller{
	vector<roller> rol = {roller(10000141), roller(5000741)};
	void extend(char a){
		rol[0].extend(a);
		rol[1].extend(a);
	}
	void extend(const string &s){
		rol[0].extend(s);
		rol[1].extend(s);
	}
	void roll(char a, char b){
		rol[0].roll(a, b);
		rol[1].roll(a, b);
	}
	void setz(){
		bi[rol[0].val] = true;
		wi[rol[1].val] = true;
	}
	bool chek(){
		return bi[rol[0].val]&&wi[rol[1].val];
	}
};

ifstream fin("abc2.in");
ofstream fout("abc2.out");

string s, q;
void altoire(const string &a){
	broller r;
	r.extend(a);
	r.setz();
}

int n;
int sol = 0;
void rezolvescu(){
	broller r;
	for(int i = 0; i < n; ++i){
		r.extend(s[i]);
	}
	if(r.chek()){
		sol++;
	}
	for(int i = n; i < s.size(); ++i){
		r.roll(s[i-n], s[i]);
		if(r.chek()){
			sol++;
		}
	}
	fout << sol;
}

int main(){
	fin >> s;
	while(fin >> q){
		n = q.size();
		altoire(q);
	}
	rezolvescu();
	return 0;
}