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 main(){
std::string s;
  std::cin>>s;
  for(char i = 'a'; i <= 'z'; ++i){
		int counter = 0;
		for(int j = 0; j <= s.length(); ++j){
			if(s[j]==i)
				++counter;
		}
		if (counter%2 == 1){
			std::cout<<"No";
			return 0;
		}
  }
	std::cout<<"Yes";
	return 0;
}
