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.IOException;
import java.io.InputStreamReader;

public class Main {

    public static void main(String[] args) {
        try {
            BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
            char[] word = reader.readLine().toCharArray();
            int count = 0;
            int Wcount = 0;
            while (true) {
                char[] context = reader.readLine().toCharArray();
                if (String.valueOf(context).equals("END_OF_TEXT")) {
                    break;
                }
                for (int i = 0; i < context.length; i++) {
                    Wcount=0;
                    for (int j = 0; j < word.length; j++) {
                        if (j + i == context.length) {
                            break;
                        } else {
                            if (word[j] == context[j + i]) {
                                Wcount++;
                            }
                            if (Wcount == word.length) {
                                if (context.length > word.length) {
                                    if (context[j + i + 1] == ' ' || context[j + i + 1] == ',') {
                                        Wcount = 0;
                                        count++;
                                        break;
                                    }
                                }
                            }
                        }
                    }
                }
            }
            System.out.println(count);

        } catch (IOException e) {

        }
    }
}