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# (.NET Core 3.1.201) (judge verdict: Accepted)

using System;
using System.Linq;

namespace Sample
{
  class Sample
  {
    static void Main(string[] args)
    {
      
      string w=Console.ReadLine();
      string[] arr=new string[w.Length];
      bool flg=false;
      for(int i=0;i<w.Length;i++){
        arr[i]=w.Substring(i,1);
      }
      string[] dis=arr.Distinct().ToArray();
      foreach(var e in dis){
        if((arr.Count(value=>value==e))%2!=0){
          flg=true;
          break;
        }
           }
     if(!flg){
       Console.WriteLine("Yes");
     }else{
       Console.WriteLine("No");
     }
    }
    
  }

}