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
#include <stdio.h>
#include <string.h>
int main(void)
{
	char w[101],a;
	int i,c;
	scanf("%s",w);
	for(a='a'; a<='z'; a++){
		c=0;
		for(i=0; i<strlen(w); i++){
			if(w[i]==a){
				c+=1;
			}
		}
		if(c%2!=0){
			printf("No\n");
			return 0;
		}
	}
	printf("Yes\n");
	return 0;
}