#define MAXNUM 26
//定义字典树结构体
typedef struct Trie
{bool flag;//从根到此是否为一个单词Trie *next[MAXNUM];
}Trie;
//声明一个根
Trie *root;
//初始化该根
void init()
{root = (Trie *)malloc(sizeof(Trie));root->flag=false;for(int i=0;i<MAXNUM;i++)root->next[i]=NULL;
}
//对该字典树的插入单词操作
void insert(char *word)
{Trie *tem = root;while(*word!='\0'){if(tem->next[*word-'a']==NULL){Trie *cur = (Trie *)malloc(sizeof(Trie));for(int i=0;i<MAXNUM;i++)cur->next[i]=NULL;cur->flag=false;tem->next[*word-'a']=cur;}tem = tem->next[*word-'a'];word++;}tem->flag=true;
}
//查询一个单词的操作
bool search(char *word)
{Trie *tem = root;for(int i=0;word[i]!='\0';i++){if(tem==NULL||tem->next[word[i]-'a']==NULL)return false;tem=tem->next[word[i]-'a'];}return tem->flag;
}//释放字典树内存操作，由于本题测试数据后程序自动跳出，所以这里没写释放内存函数void del(Trie *cur){    for(int i=0;i<MAXNUM;i++)    {        if(cur->next[i]!=NULL)        del(cur->next[i]);    }    free(cur);}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define MAXNUM 26
using namespace std;
//单词
char words[50005][12];
//定义字典树
typedef struct Trie
{bool flag;//从根到此是否为一个单词Trie *next[MAXNUM];
}Trie;Trie *root;
int count_num;void init()
{root = (Trie *)malloc(sizeof(Trie));root->flag=false;for(int i=0;i<MAXNUM;i++)root->next[i]=NULL;
}void insert(char *word)
{Trie *tem = root;while(*word!='\0'){if(tem->next[*word-'a']==NULL){Trie *cur = (Trie *)malloc(sizeof(Trie));for(int i=0;i<MAXNUM;i++)cur->next[i]=NULL;cur->flag=false;tem->next[*word-'a']=cur;}tem = tem->next[*word-'a'];word++;}tem->flag=true;
}void dfs(Trie *cur)
{if(cur->flag)count_num++;for(int i=0;i<MAXNUM;i++){if(cur->next[i]!=NULL)dfs(cur->next[i]);}
}int search(char *word)
{Trie *tem = root;count_num = 0;for(int i=0;word[i]!='\0';i++){if(tem==NULL||tem->next[word[i]-'a']==NULL)return 0;tem=tem->next[word[i]-'a'];}dfs(tem);return 1;
}int main()
{init();int t=0;char w[12];while(gets(w)){if(*w=='\0')break;insert(w);t++;}while(scanf("%s",w)!=EOF){search(w);printf("%d\n",count_num);}return 0;
}