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 (Clang 3.8.0) (judge verdict: Accepted)

#include<stdio.h>
#include<string.h>

int main(void)

{
  int i;
  char str[101];
  for(i=0;i<100;i++)
    {
      str[i] = '0';
    }
  scanf("%s",&str);

  int alphabet[26];
  for(i=0;i<(sizeof(alphabet)/sizeof(alphabet[1]));i++)
    {
      alphabet[i] = 0;
    }

  char judger[26] = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
  for(i=0;i<101;i++)
    {
      int j;
      for(j=0;j<(sizeof(alphabet)/sizeof(alphabet[1]));j++)
        {
          if(str[i]==judger[j])
            {
              alphabet[j]++;
            }
          else
            {
            }
        }
    }
  /*
  for(i=0;i<26;i++)
    {
      printf("%c\n",str[i]);
    }
  */
  for(i=0;i<26;i++)
    {
      if(alphabet[i]%2 == 0)
        {
          if(i<25)
            {

            }
          else if(i == 25)
            {
              printf("Yes\n");
              break;
            }
          else
            {
              break;
            }
        }
      else
        {
          printf("No\n");
          break;
        }
    }
}