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

import java.util.Scanner

object Main extends App  {
  val sc = new Scanner(System.in)
  val w = sc.next.split("(?<=.)")

  val ac = new Array[Int](26)
  val alphabets = "abcdefghijklmnopqrstuvwxyz"

  val tArr =
    w.foldLeft(ac){case (arr, c) =>
      val i = alphabets.indexOf(c)
      val x = arr(i)
      arr.update(i, x + 1)
      arr
    }

  val res = if(tArr.forall(_ % 2 == 0)) "Yes" else "No"

  println(res)
}