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

namespace ABC
{
	class MainClass
	{
		public static void Main (string[] args)
		{
			//var a = Console.ReadLine ().Split().Select(x=>int.Parse(x)).ToArray();
			string N = Console.ReadLine ();
			int chartoint = 0;
			int[] result = new int[N.Length];
			for (int i = 0; i < N.Length; i++) {
				chartoint = N [i] - 'a';
				result [i] = chartoint;
			}
			int a = 0;
			bool flag = true;
			for (int i = 0; i < 26; i++) {
				a = 0;
				for (int j = 0; j < N.Length; j++) {
					{
						if (result[j] == i)
							a++;
					}
				}
				if (a % 2 != 0) {
					Console.WriteLine ("No");
					flag = false;
					break;
				}	
			}

			if (flag)
				Console.WriteLine ("Yes");
		}
	}
}