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 System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace paiza2
{
    class Program
    {
        static void Main(string[] args)
        {
            int outflag = 0;
            string w = Console.ReadLine();
            for (int c = 0; c < w.Length; c++)
            {
                char looking = w[c];
                int check = 0;
                for (int c_n = 0; c_n < w.Length; c_n++)
                {
                    if (looking == w[c_n]) check++;
                }
                if (check % 2 != 0)
                {
                    outflag = 1;
                    break;
                }

            }
            if (outflag == 1)
                Console.WriteLine("No");
            else
                Console.WriteLine("Yes");
        }
    }
}