Problem:
Score : 200 points

Problem Statement

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.

Sample Input 1

abaccaba

Sample Output 1

Yes

a occurs four times, b occurs twice, c occurs twice and the other letters occur zero times.

Sample Input 2

hthth

Sample Output 2

No

Solution in C (GCC 5.4.1) (judge verdict: Accepted)

#include<stdio.h>
#include<string.h>
int main()
{
char ch[100000];
gets(ch);
int i,j,k,l,n;
l=strlen(ch);
for(i='a';i<='z';i++)
{
int temp=0;
for(j=0;j<l;j++)
{
if(i==ch[j])
{

temp++;
}


}
if(temp%2!=0)
{
printf("No\n");
return 0;

}


}
printf("Yes\n");
return 0;

}