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 JAVA (judge verdict: Wrong Answer)

import java.util.*;
import java.util.regex.Pattern;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc=new Scanner(System.in);
        String w=sc.next();
        int cnt=0;
        char c;
        String str;
        String[] str2;
        int i;
        while(true){
            str=sc.next();
            if(str.equals("END_OF_TEXT"))break;
            c=getSymbolInString(str);
            str2=null;
            if(c!='a'){
                str2=str.split(Pattern.quote(String.valueOf(c)),0);
            }else{
                str2=new String[1];
                str2[0]=str;
            }
            for(i=0;i<str2.length;i++)if(str2[i].toLowerCase().equals(w))cnt++;
        }
        System.out.println(cnt);
    }
    
    static char getSymbolInString(String s){
        char c;
        int i;
        for(i=0;i<s.length();i++){
            c=s.charAt(i);
            if(c<'a'||c>'z')return c;
        }
        return 'a';
    }
}