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