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;
class Program
{
  static void Main(string[] args)
  {
    string str = Console.ReadLine();
    string stdout = "Yes";

    // wが奇数だったらその時点で美しい文字列でない
    if (str.Length % 2 == 1) {
      stdout = "No";
    }
    else
    {
      // 文字ごとのカウンター
      int[] arry = new int[26];

      foreach(char chr in str)
      {
        switch(chr)
        {
          case 'a':
            arry[0]++;
            break;
          case 'b':
            arry[1]++;
            break;
          case 'c':
            arry[2]++;
            break;
          case 'd':
            arry[3]++;
            break;
          case 'e':
            arry[4]++;
            break;
          case 'f':
            arry[5]++;
            break;
          case 'g':
            arry[6]++;
            break;
          case 'h':
            arry[7]++;
            break;
          case 'i':
            arry[8]++;
            break;
          case 'j':
            arry[9]++;
            break;
          case 'k':
            arry[10]++;
            break;
          case 'l':
            arry[11]++;
            break;
          case 'm':
            arry[12]++;
            break;
          case 'n':
            arry[13]++;
            break;
          case 'o':
            arry[14]++;
            break;
          case 'p':
            arry[15]++;
            break;
          case 'q':
            arry[16]++;
            break;
          case 'r':
            arry[17]++;
            break;
          case 's':
            arry[18]++;
            break;
          case 't':
            arry[19]++;
            break;
          case 'u':
            arry[20]++;
            break;
          case 'v':
            arry[21]++;
            break;
          case 'w':
            arry[22]++;
            break;
          case 'x':
            arry[23]++;
            break;
          case 'y':
            arry[24]++;
            break;
          case 'z':
            arry[25]++;
            break;
        }
      }

      foreach(int cnt in arry)
      {
        if (cnt % 2 == 1) {
          stdout = "No";
        }
      }
    }

    Console.WriteLine(stdout);

  }
}