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(){
  string w;
  cin>>w;
  int sz=w.size();
  for(int i=0;i<sz;i++){
    int cnt=0;
    for(int j=0;j<sz;j++){
      if(w[i]==w[j]){
        cnt++;
      }
    }
    if(cnt%2!=0){ cout<<"No"; return 0;}
  }
  cout<<"Yes";
}
