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>
using namespace std;

int main() {
	int arr[26]={};
	string ss;
	cin>>ss;
	for (int i=0; i<ss.length(); i++){
		int x = (ss[i]-'a');
		arr[x]++;
	}
	for (int i=0; i<26; i++){
		if (arr[i]>0 and arr[i]%2==1){
			cout << "No\n";
			return 0;
		}
	}
	cout << "Yes\n";
}