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 Scala (judge verdict: Accepted)

object Main {
  val Offset: Int = 'a' - 'A'
  val EOT: String = "END_OF_TEXT"

  def main(args: Array[String]): Unit = {
    val target = io.StdIn.readLine().toLowerCase
    val count =
      Iterator.continually(io.StdIn.readLine())
        .takeWhile(_ != EOT)
        .flatMap(toLowerCaseWords)
        .count(_ == target)

    println(count)
  }

  def toLowerCaseWords(line: String): Seq[String] = {
    import collection.mutable
    val words = mutable.Buffer.empty[String]
    var length = 0
    val buf = new Array[Char](1000 + 1)
    line.foreach { c =>
      if ('A' <= c && c <= 'Z' || 'a' <= c && c <= 'z') {
        buf(length) = c.toLower
        length += 1
      } else if (length > 0) {
        if (length <= 10) {
          words += String.valueOf(buf.take(length))
        }
        length = 0
      }
    }
    if (length > 0) {
      words += String.valueOf(buf.take(length))
    }
    words
  }
}