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;
int cnt[26];
signed main(){
	string w;
	cin>>w;
	rep(i,w.size()){
		cnt[w[i]-'a']++;
	}
	rep(i,26){
		if(cnt[i]%2==1){
			puts("No");
			return 0;
		}
	}
	puts("Yes");
}
		
		
