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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.util.Scanner;
import java.util.ArrayList;

public class Main{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    String str = sc.next();
    ArrayList<String> list = new ArrayList<String>();
    String str1;
    int count = 0;
    for(int i=0;i<str.length();i++){
      list.add(str.substring(i,i+1));
    }
    for(int i=0;i<list.size();i++){
      count = 0;
      str1 = list.get(i);
      for(int m=0;m<list.size();m++){
        if(list.get(m).equals(str1)){
          count++;
        }
      }
      if(count%2==1){
        System.out.println("No");
        return;
      }
    }
    System.out.println("Yes");
  }
}