Problem:
Score : 200 points

Problem Statement

Let w be a string consisting of lowercase letters.
We will call w beautiful if the following condition is satisfied:

Each lowercase letter of the English alphabet occurs even number of times in w.

You are given the string w. Determine if w is beautiful.

Constraints

1 \leq |w| \leq 100

w consists of lowercase letters (a-z).

Input

The input is given from Standard Input in the following format:

w

Output

Print Yes if w is beautiful. Print No otherwise.

Sample Input 1

abaccaba

Sample Output 1

Yes

a occurs four times, b occurs twice, c occurs twice and the other letters occur zero times.

Sample Input 2

hthth

Sample Output 2

No

Solution in Scala (2.11.7) (judge verdict: Wrong Answer)

object Main extends App {

  val arr = scala.io.StdIn.readLine().split("")
  val map = scala.collection.mutable.Map[String, Int]()
  arr.foreach { s =>
    if (map.contains(s)) {
      map(s) = map.get(s).get + 1
    } else {
      map(s) = 1
    }
  }

  var flag = true
  map.foreach { case (s, i) =>
    if (i % 2 != 0) {
      flag = false
    }
  }

  if (flag) println("Yes")
  else println("No")

}