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>
using namespace std;
signed main(){
 string a;
  int c=1,b[100000]={};
  cin>>a;
  for(int i=0;i<a.size();i++){
    b[a[i]]++;
  }
  for(int i=0;i<1000;i++){
    if(b[i]%2==1) c=0;
  }
  if(c) cout<<"Yes";
  else cout<<"No";
  cout<<"\n";
}