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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using static System.Console;
using static System.Math;

public class Hello{
    public static void Main(){
        string str = ReadLine();
        int leng = str.Length;
        if(leng%2 == 0){
            int check = 0;
            while(leng>0){
                string a = str[0].ToString();
//                WriteLine(a);
                str = str.Replace(a,"");
                leng = str.Length;
                if(leng %2 == 1){
                    check++;
                }
            }
            if(check == 0){
                WriteLine("Yes");
            }else{
                WriteLine("No");
            }
        }else{
            WriteLine("No");
        }
    }
}