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 s[999];int cnt[26];
int main(){
	scanf("%s",s);
	for(int i=0; s[i]; i++)
		cnt[s[i]-'a']++;
	bool flag=true;
	for(int i=0; i<26; i++)
		if(cnt[i]%2)
			flag=false;
	puts(flag?"Yes":"No");
	return 0;
}