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>
#include<string>
using namespace std;
int main(){
string w;
cin >>w;
int a[26]={};
for(int i=0;i<w.size();i++){
a[w[i]-'a']++;
}
bool flag=true;
for(int i=0;i<26;i++){
if(a[i]%2!=0)
flag=false;
}
if(flag)
cout <<"Yes";
else
cout<<"No";
return 0;
}
