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 Java (OpenJDK 11.0.6) (judge verdict: Accepted)

import java.util.Scanner;
import java.util.HashMap;

public class Main {
  public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);
    
    String[] w = scanner.nextLine().split("");
    
    // どの文字がいくつあるか
    HashMap<String, Integer> map = new HashMap<>();
    for(String word: w) {
      // マップから今の値を取得
      Integer num = map.get(word);
      // これがnullなら1をマップにいれる
      if(num == null) {
        map.put(word, 1);
      } else {
        // そうでなければその値 + 1をマップに戻す
        map.put(word, num + 1);
      }
    }
    
    // マップの「キーのコレクション」から「それぞれのキー」を取り出す
    boolean flg = true;
    for(String key: map.keySet()) {
      // 「キー」に対応した「値」が偶数か調べる
      if(map.get(key) % 2 != 0) {
        flg = false;
      }
    }
    
    if(flg) {
      System.out.println("Yes");
    } else {
      System.out.println("No");
    }
  }
}