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<iostream>
int c[26],i;char a;
int main(){
	for(;(std::cin>>a)&&a!=10;c[a-97]++);
	for(;i<26;)c[i++]%2?a=0:0;
	std::cout<<(a?"Yes\n":"No\n");
}