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.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.IOException;
import java.util.LinkedList;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

public class Main {

    public static void main(String args[]) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        String[] T = br.readLine().split(" ");
        LinkedList<String> word = new LinkedList<>();
        String input;
        while (!(input = br.readLine()).equals("END_OF_TEXT")) {
            word.add(input);
        }
        int count = 0;
        for (String t : T) {
            Pattern pattern = Pattern.compile(t, Pattern.CASE_INSENSITIVE);
            for (String w : word) {
                Matcher matcher = pattern.matcher(w);
                while (matcher.find()) {
                    count++;
                }
            }
        }
        
        bw.append(count + "\n");
        bw.flush();
    }

}