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.

Examples

Input

abaccaba


Output

Yes


Input

hthth


Output

No
import java.util.*;

class Main{
    public static void main(String[] args){
	int alpha[] =new  int[26];
	Scanner sc = new Scanner(System.in);
	String bun = sc.next();
	char[] block = bun.toCharArray();

	for(int i = 0;i<bun.length();i++){
	    alpha[(int)block[i]-'a'] +=1; 
	    
	}
	int even = 0;
	for(int i = 0;i<26;i++){
	    if(alpha[i]%2 !=0){
		even = 1;
	    }
	}

	if(even == 0){System.out.println("Yes");}else{System.out.println("No");}
	
    }

}
