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>
int main(){
	char a[110];
	int i, b[50]={},t=1;
	scanf("%s",a);
	for(i=0;a[i]!='\0';i++){
		b[a[i]-'a']++;
	}
	for(i=0;i<40;i++){
		if(b[i]%2!=0) t=0;
	}
	if(t==1)printf("Yes\n");
	else printf("No\n");
}