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

package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
)

var sc = bufio.NewScanner(os.Stdin)

func nextLine() string {
	sc.Scan()
	return sc.Text()
}

func main() {
	w := []byte(nextLine())
	var w2 []int
	for i := 0; i < len(w); i++ {
		w2 = append(w2, int(w[i]))
	}
	if len(w)%2 != 0 {
		fmt.Println("No")
	} else {
		sort.Sort(sort.IntSlice(w2))
		for i := 0; i < len(w)/2; i++ {
			if w2[2*i] != w2[2*i+1] {
				fmt.Println("No")
				return
			}
		}
		fmt.Println("Yes")
	}
}