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: Accepted)

import java.util.*;

public class Main {
    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        String line = sc.nextLine();
        String W = line.toUpperCase();

        int count = 0;
        while(!((line = sc.nextLine()).equals("END_OF_TEXT"))) {
          String[] l = line.split(" ");
          for(int i = 0; i < l.length; i++) {
            if(W.equals(l[i].toUpperCase())) {
              count++;
            }
          }
        }

        System.out.println(count);

//        String line = sc.nextLine();
//        char[] W = line.toCharArray(); //word
//
//        int count = 0;
//        while(!((line = sc.nextLine()).equals("END_OF_TEXT"))) {
//          char[] T = line.toCharArray();
//
//          for(int i = 0; i < T.length; i++) {
//            if(Character.toUpperCase(T[i]) == Character.toUpperCase(W[0]) && i + W.length - 1 < T.length) {
//              for(int j = 0; j < W.length; j++) {
//                if(Character.toUpperCase(T[i + j]) != Character.toUpperCase(W[j])) {
//                  break;
//                } else if(j == W.length - 1) {
//                  count++;
//                }
//              }
//            }
//          }
//        }
//
//        System.out.println(count);
    }
}