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 <bits/stdc++.h>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
string s;
int aa[120];
signed main(){
	cin>>s;
	rep(i,s.size()){
		int a=s[i];
		aa[a]++;
	}
	rep(i,120){
		if(aa[i]%2==1){
			cout<<"No";
			return 0;
		}
	}
	cout<<"Yes";
}