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<cstdio>

using namespace std;

int c[26];

int check(){
	for(int i = 0; i < 26; i++) if(c[i] & 1) return 0;
	return 1;
}

int main(){
	char w[110]; scanf("%s", w);
	for(int i = 0; w[i] != '\0'; i++) c[w[i] - 'a']++;
	puts(check() ? "Yes" : "No");
	return 0;
}