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 cnt[26];
char str[101];

int main()
{
	int i;
	
	scanf("%s", str);
	for(i=0;i<strlen(str);i++) cnt[str[i]-'a']++;
	
	for(i=0;i<26;i++){
		if(cnt[i]%2 == 1) break;
	}
	
	if(i < 26) printf("No");
	else printf("Yes");
	
	return 0;
}