Problem:
Finding a Word

Write a program which reads a word W and a text T, and prints the number of word W which appears in text T

T consists of string Ti separated by space characters and newlines. Count the number of Ti which equals to W. The word and text are case insensitive.

Constraints

The length of W ≤ 10

W consists of lower case letters

The length of T in a line ≤ 1000

Input

In the first line, the word W is given. In the following lines, the text T is given separated by space characters and newlines.

"END_OF_TEXT" indicates the end of the text.

Output

Print the number of W in the text.

Sample Input

computer
Nurtures computer scientists and highly-skilled computer engineers
who will create and exploit "knowledge" for the new era.
Provides an outstanding computer environment.
END_OF_TEXT

Sample Output

3

Solution in C (judge verdict: Accepted)

#include<stdio.h>
int main()
{
  char w[11],t[1000][1000];
  int x=0,i,j;
  int wl,tl[1000],r;
  for(i=0;;i++)
    {
      scanf("%c",&w[i]);
      if(w[i]=='\n') break;
      else if((w[i]>='A')&&(w[i]<='Z')) w[i]+='a'-'A';
    }
  wl=i;
  for(i=0;;i++)
    {
      for(j=0;;j++)
	{
	  scanf("%c",&t[i][j]);	  
	  if((t[i][j]==' ')||(t[i][j]=='\n')||(t[i][j]=='\t'))
	    {
	      tl[i]=j;
	      break;
	    }
	}
      if((t[i][0]=='E')&&(t[i][1]=='N')&&(t[i][2]=='D')&&(t[i][3]=='_')&&(t[i][4]=='O')&&(t[i][5]=='F')&&(t[i][6]=='_')&&(t[i][7]=='T')&&(t[i][8]=='E')&&(t[i][9]=='X')&&(t[i][10]=='T')) break;
      else
	{
	  for(j=0;j<tl[i];j++)
	    {
	      if((t[i][j]>='A')&&(t[i][j]<='Z')) t[i][j]+='a'-'A';
	    }	
	}
    }
  r=i;
  for(i=0;i<r;i++)
    {
      if(wl!=tl[i]) continue;
      for(j=0;j<tl[i];j++)
	{
	  if(w[j]!=t[i][j]) break;
	}
      if(j==tl[i]) x++;
    }
  printf("%d\n",x);
  return 0;
}