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 s;
  int r=0,a[26]={};
  cin>>s;
  for(int i=0;i<s.size();i++) a[s[i]-'a']++;
  for(int i=0;i<26;i++) if(a[i]%2) r=1;
  if(r) cout<<"No"<<endl;
  else cout<<"Yes"<<endl;
}
