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 c;
	int ar[27]={0},i;
	while(~scanf("%c", &c))
		ar[c-97]++;
	for(i=0; i<26; i++)
		if(ar[i]%2)
			break;
	if(i==26) printf("Yes\n");
	else printf("No\n");
	return 0;
}