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

/**
 * @author karayuu
 */
fun main(args: Array<String>) {
    val string = readLine()!!
    val list = mutableListOf<Int>()
    ('a'..'z').forEach { character ->
        list.add(string.count { it == character })
    }

    if (list.isSame()) print("Yes") else print("No")
}

fun MutableList<Int>.isSame() : Boolean {
    for (j in this) {
        if (!j.isEven()) return false
    }
    return true
}

fun Int.isEven() : Boolean = this % 2 == 0