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.io.*;
import java.util.*;

public class Main{
    public static void main(String[] args)throws IOException{
        Scanner scan = new Scanner(System.in);
        String str = scan.next();
        
        char[] atoz = new char[26];
        
        atoz[0]='a'; atoz[13]='n';
        atoz[1]='b'; atoz[14]='o';
        atoz[2]='c'; atoz[15]='p';
        atoz[3]='d'; atoz[16]='q';
        atoz[4]='e'; atoz[17]='r';
        atoz[5]='f'; atoz[18]='s';
        atoz[6]='g'; atoz[19]='t';
        atoz[7]='h'; atoz[20]='u';
        atoz[8]='i'; atoz[21]='v';
        atoz[9]='j'; atoz[22]='w';
        atoz[10]='k'; atoz[23]='x';
        atoz[11]='l'; atoz[24]='y';
        atoz[12]='m'; atoz[25]='z';
        
        int count = 0;
        for(int i = 0; i <26; i++){
            count = 0;
            for(int j = 0; j < str.length(); j++){
                if(atoz[i] == str.charAt(j)){
                    //文字列のj番目とi番目のアルファベットが一致していたら+1
                    count++;
                }
            }
            //countが奇数の場合はNo確定なので終了
            if(count%2 == 1){
               System.out.println("No");
               break;
            }
            if(i == 25){
                System.out.println("Yes");
            }
        }                
    }
}